./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.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 37139db5f2012b0b7a96ab437e26855d856636bc4064d013c0b416905ff6e54c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:46:11,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:46:11,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:46:11,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:46:11,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:46:11,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:46:11,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:46:11,180 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:46:11,181 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:46:11,181 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:46:11,181 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:46:11,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:46:11,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:46:11,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:46:11,182 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:46:11,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:46:11,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:46:11,186 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:46:11,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:46:11,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:46:11,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:46:11,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:46:11,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:46:11,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:46:11,190 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:46:11,190 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:46:11,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:46:11,191 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:46:11,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:46:11,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:46:11,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:46:11,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:46:11,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:46:11,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:46:11,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:46:11,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:46:11,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:46:11,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:46:11,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:46:11,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:46:11,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:46:11,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:46:11,194 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 -> 37139db5f2012b0b7a96ab437e26855d856636bc4064d013c0b416905ff6e54c [2024-10-12 21:46:11,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:46:11,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:46:11,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:46:11,406 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:46:11,406 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:46:11,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c [2024-10-12 21:46:12,771 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:46:12,923 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:46:12,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c [2024-10-12 21:46:12,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1736988c6/1d09283364a94660b8da3f7ceca88d22/FLAG060b808b1 [2024-10-12 21:46:12,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1736988c6/1d09283364a94660b8da3f7ceca88d22 [2024-10-12 21:46:12,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:46:12,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:46:12,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:46:12,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:46:12,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:46:12,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:46:12" (1/1) ... [2024-10-12 21:46:12,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a56314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:12, skipping insertion in model container [2024-10-12 21:46:12,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:46:12" (1/1) ... [2024-10-12 21:46:13,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:46:13,144 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c[911,924] [2024-10-12 21:46:13,201 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c[8416,8429] [2024-10-12 21:46:13,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:46:13,273 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:46:13,284 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c[911,924] [2024-10-12 21:46:13,303 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c[8416,8429] [2024-10-12 21:46:13,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:46:13,349 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:46:13,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:13 WrapperNode [2024-10-12 21:46:13,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:46:13,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:46:13,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:46:13,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:46:13,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:13" (1/1) ... [2024-10-12 21:46:13,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:13" (1/1) ... [2024-10-12 21:46:13,412 INFO L138 Inliner]: procedures = 63, calls = 73, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 626 [2024-10-12 21:46:13,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:46:13,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:46:13,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:46:13,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:46:13,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:13" (1/1) ... [2024-10-12 21:46:13,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:13" (1/1) ... [2024-10-12 21:46:13,437 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:13" (1/1) ... [2024-10-12 21:46:13,465 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 21:46:13,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:13" (1/1) ... [2024-10-12 21:46:13,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:13" (1/1) ... [2024-10-12 21:46:13,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:13" (1/1) ... [2024-10-12 21:46:13,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:13" (1/1) ... [2024-10-12 21:46:13,483 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:13" (1/1) ... [2024-10-12 21:46:13,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:13" (1/1) ... [2024-10-12 21:46:13,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:46:13,489 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:46:13,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:46:13,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:46:13,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:13" (1/1) ... [2024-10-12 21:46:13,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:46:13,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:46:13,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:46:13,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:46:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:46:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:46:13,621 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:46:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-12 21:46:13,621 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-12 21:46:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-12 21:46:13,621 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-12 21:46:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-12 21:46:13,622 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-12 21:46:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-12 21:46:13,622 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-12 21:46:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-12 21:46:13,622 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-12 21:46:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-12 21:46:13,622 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-12 21:46:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-12 21:46:13,623 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-12 21:46:13,623 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-12 21:46:13,623 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-12 21:46:13,623 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-12 21:46:13,623 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-12 21:46:13,623 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-12 21:46:13,623 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-12 21:46:13,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:46:13,623 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-12 21:46:13,624 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-12 21:46:13,624 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-12 21:46:13,624 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-12 21:46:13,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:46:13,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:46:13,624 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-12 21:46:13,624 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-12 21:46:13,737 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:46:13,739 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:46:14,209 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-10-12 21:46:14,210 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-10-12 21:46:14,303 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2024-10-12 21:46:14,303 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:46:14,354 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:46:14,354 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-12 21:46:14,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:46:14 BoogieIcfgContainer [2024-10-12 21:46:14,355 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:46:14,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:46:14,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:46:14,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:46:14,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:46:12" (1/3) ... [2024-10-12 21:46:14,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74085fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:46:14, skipping insertion in model container [2024-10-12 21:46:14,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:13" (2/3) ... [2024-10-12 21:46:14,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74085fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:46:14, skipping insertion in model container [2024-10-12 21:46:14,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:46:14" (3/3) ... [2024-10-12 21:46:14,361 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.04.cil-1.c [2024-10-12 21:46:14,374 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:46:14,374 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:46:14,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:46:14,428 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;@60bfcd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:46:14,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:46:14,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 268 states, 217 states have (on average 1.6682027649769586) internal successors, (362), 223 states have internal predecessors, (362), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 21:46:14,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:46:14,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:14,443 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] [2024-10-12 21:46:14,443 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:14,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:14,455 INFO L85 PathProgramCache]: Analyzing trace with hash 759238749, now seen corresponding path program 1 times [2024-10-12 21:46:14,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:14,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369653193] [2024-10-12 21:46:14,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:14,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:14,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:14,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:14,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:46:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:14,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:46:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:14,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:46:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:14,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:46:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:14,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:46:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:14,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:14,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369653193] [2024-10-12 21:46:14,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369653193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:14,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:14,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:46:14,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680746183] [2024-10-12 21:46:14,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:14,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:46:14,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:14,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:46:14,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:46:14,994 INFO L87 Difference]: Start difference. First operand has 268 states, 217 states have (on average 1.6682027649769586) internal successors, (362), 223 states have internal predecessors, (362), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:46:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:16,146 INFO L93 Difference]: Finished difference Result 690 states and 1108 transitions. [2024-10-12 21:46:16,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 21:46:16,149 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-12 21:46:16,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:16,164 INFO L225 Difference]: With dead ends: 690 [2024-10-12 21:46:16,165 INFO L226 Difference]: Without dead ends: 434 [2024-10-12 21:46:16,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-12 21:46:16,172 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 799 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:16,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1356 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:46:16,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-10-12 21:46:16,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 368. [2024-10-12 21:46:16,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 296 states have (on average 1.5405405405405406) internal successors, (456), 303 states have internal predecessors, (456), 47 states have call successors, (47), 21 states have call predecessors, (47), 23 states have return successors, (56), 46 states have call predecessors, (56), 45 states have call successors, (56) [2024-10-12 21:46:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 559 transitions. [2024-10-12 21:46:16,246 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 559 transitions. Word has length 57 [2024-10-12 21:46:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:16,246 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 559 transitions. [2024-10-12 21:46:16,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:46:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 559 transitions. [2024-10-12 21:46:16,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:46:16,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:16,250 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] [2024-10-12 21:46:16,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:46:16,250 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:16,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:16,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1652725087, now seen corresponding path program 1 times [2024-10-12 21:46:16,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:16,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981943014] [2024-10-12 21:46:16,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:16,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:16,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:16,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:16,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:46:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:16,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:46:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:16,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:46:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:16,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:46:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:16,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:46:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:16,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:16,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:16,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981943014] [2024-10-12 21:46:16,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981943014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:16,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:16,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:16,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265262529] [2024-10-12 21:46:16,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:16,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:16,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:16,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:16,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:16,336 INFO L87 Difference]: Start difference. First operand 368 states and 559 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 21:46:17,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:17,110 INFO L93 Difference]: Finished difference Result 768 states and 1145 transitions. [2024-10-12 21:46:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:46:17,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 57 [2024-10-12 21:46:17,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:17,116 INFO L225 Difference]: With dead ends: 768 [2024-10-12 21:46:17,117 INFO L226 Difference]: Without dead ends: 576 [2024-10-12 21:46:17,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:46:17,119 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 1067 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:17,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 826 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:46:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-10-12 21:46:17,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 538. [2024-10-12 21:46:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 429 states have (on average 1.508158508158508) internal successors, (647), 439 states have internal predecessors, (647), 67 states have call successors, (67), 35 states have call predecessors, (67), 40 states have return successors, (82), 66 states have call predecessors, (82), 65 states have call successors, (82) [2024-10-12 21:46:17,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 796 transitions. [2024-10-12 21:46:17,171 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 796 transitions. Word has length 57 [2024-10-12 21:46:17,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:17,171 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 796 transitions. [2024-10-12 21:46:17,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 21:46:17,172 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 796 transitions. [2024-10-12 21:46:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:46:17,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:17,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:17,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:46:17,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:17,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:17,176 INFO L85 PathProgramCache]: Analyzing trace with hash -178299430, now seen corresponding path program 1 times [2024-10-12 21:46:17,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:17,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118278346] [2024-10-12 21:46:17,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:17,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:17,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:17,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:17,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:46:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:17,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:46:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:17,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:17,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 21:46:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:17,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:46:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:17,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:17,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118278346] [2024-10-12 21:46:17,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118278346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:17,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:17,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:46:17,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207380758] [2024-10-12 21:46:17,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:17,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:46:17,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:17,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:46:17,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:46:17,282 INFO L87 Difference]: Start difference. First operand 538 states and 796 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:46:17,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:17,985 INFO L93 Difference]: Finished difference Result 934 states and 1371 transitions. [2024-10-12 21:46:17,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:46:17,985 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-12 21:46:17,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:17,988 INFO L225 Difference]: With dead ends: 934 [2024-10-12 21:46:17,988 INFO L226 Difference]: Without dead ends: 572 [2024-10-12 21:46:17,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:46:17,990 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 478 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:17,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1271 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:46:17,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-10-12 21:46:18,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 546. [2024-10-12 21:46:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 435 states have (on average 1.4965517241379311) internal successors, (651), 445 states have internal predecessors, (651), 67 states have call successors, (67), 35 states have call predecessors, (67), 42 states have return successors, (84), 68 states have call predecessors, (84), 65 states have call successors, (84) [2024-10-12 21:46:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 802 transitions. [2024-10-12 21:46:18,019 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 802 transitions. Word has length 58 [2024-10-12 21:46:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:18,019 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 802 transitions. [2024-10-12 21:46:18,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:46:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 802 transitions. [2024-10-12 21:46:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:46:18,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:18,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:18,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:46:18,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:18,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:18,022 INFO L85 PathProgramCache]: Analyzing trace with hash -250685988, now seen corresponding path program 1 times [2024-10-12 21:46:18,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:18,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756965012] [2024-10-12 21:46:18,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:18,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:18,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:18,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:18,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:46:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:18,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:46:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:18,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:18,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 21:46:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:18,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:46:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:18,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:18,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756965012] [2024-10-12 21:46:18,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756965012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:18,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:18,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:46:18,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528615142] [2024-10-12 21:46:18,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:18,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:46:18,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:18,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:46:18,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:46:18,127 INFO L87 Difference]: Start difference. First operand 546 states and 802 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 21:46:19,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:19,727 INFO L93 Difference]: Finished difference Result 1878 states and 2784 transitions. [2024-10-12 21:46:19,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 21:46:19,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2024-10-12 21:46:19,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:19,731 INFO L225 Difference]: With dead ends: 1878 [2024-10-12 21:46:19,731 INFO L226 Difference]: Without dead ends: 766 [2024-10-12 21:46:19,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-10-12 21:46:19,734 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 1495 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 2368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:19,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1637 Invalid, 2368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:46:19,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-10-12 21:46:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 690. [2024-10-12 21:46:19,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 540 states have (on average 1.45) internal successors, (783), 553 states have internal predecessors, (783), 87 states have call successors, (87), 49 states have call predecessors, (87), 61 states have return successors, (120), 90 states have call predecessors, (120), 85 states have call successors, (120) [2024-10-12 21:46:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 990 transitions. [2024-10-12 21:46:19,770 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 990 transitions. Word has length 58 [2024-10-12 21:46:19,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:19,770 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 990 transitions. [2024-10-12 21:46:19,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 21:46:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 990 transitions. [2024-10-12 21:46:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:46:19,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:19,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:19,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:46:19,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:19,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash -314677635, now seen corresponding path program 1 times [2024-10-12 21:46:19,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:19,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757951532] [2024-10-12 21:46:19,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:19,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:19,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:19,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:19,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:46:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:19,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:46:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:19,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:19,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:46:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:19,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:46:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:19,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:19,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757951532] [2024-10-12 21:46:19,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757951532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:19,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:19,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:46:19,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776732845] [2024-10-12 21:46:19,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:19,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:46:19,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:19,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:46:19,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:46:19,928 INFO L87 Difference]: Start difference. First operand 690 states and 990 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 21:46:20,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:20,774 INFO L93 Difference]: Finished difference Result 1520 states and 2196 transitions. [2024-10-12 21:46:20,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 21:46:20,775 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2024-10-12 21:46:20,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:20,777 INFO L225 Difference]: With dead ends: 1520 [2024-10-12 21:46:20,777 INFO L226 Difference]: Without dead ends: 163 [2024-10-12 21:46:20,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-12 21:46:20,788 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 860 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:20,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 922 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:46:20,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-12 21:46:20,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-12 21:46:20,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.5724637681159421) internal successors, (217), 139 states have internal predecessors, (217), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-12 21:46:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 253 transitions. [2024-10-12 21:46:20,814 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 253 transitions. Word has length 59 [2024-10-12 21:46:20,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:20,815 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 253 transitions. [2024-10-12 21:46:20,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 21:46:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 253 transitions. [2024-10-12 21:46:20,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 21:46:20,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:20,817 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] [2024-10-12 21:46:20,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:46:20,817 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:20,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:20,817 INFO L85 PathProgramCache]: Analyzing trace with hash -468735642, now seen corresponding path program 1 times [2024-10-12 21:46:20,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:20,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958068988] [2024-10-12 21:46:20,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:20,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:20,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:20,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:46:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:20,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:46:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:20,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:46:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:20,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:46:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:20,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:20,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958068988] [2024-10-12 21:46:20,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958068988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:20,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:20,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:46:20,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248081296] [2024-10-12 21:46:20,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:20,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:46:20,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:20,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:46:20,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:46:20,959 INFO L87 Difference]: Start difference. First operand 163 states and 253 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:21,699 INFO L93 Difference]: Finished difference Result 367 states and 580 transitions. [2024-10-12 21:46:21,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:46:21,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 21:46:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:21,705 INFO L225 Difference]: With dead ends: 367 [2024-10-12 21:46:21,705 INFO L226 Difference]: Without dead ends: 213 [2024-10-12 21:46:21,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:46:21,707 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 405 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:21,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 294 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:46:21,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-12 21:46:21,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 163. [2024-10-12 21:46:21,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.565217391304348) internal successors, (216), 139 states have internal predecessors, (216), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-12 21:46:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 252 transitions. [2024-10-12 21:46:21,732 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 252 transitions. Word has length 81 [2024-10-12 21:46:21,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:21,732 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 252 transitions. [2024-10-12 21:46:21,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:21,732 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 252 transitions. [2024-10-12 21:46:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 21:46:21,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:21,733 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] [2024-10-12 21:46:21,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:46:21,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:21,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:21,734 INFO L85 PathProgramCache]: Analyzing trace with hash 498615012, now seen corresponding path program 1 times [2024-10-12 21:46:21,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:21,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997072294] [2024-10-12 21:46:21,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:21,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:21,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:21,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:46:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:21,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:46:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:21,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:46:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:21,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:46:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:21,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:21,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997072294] [2024-10-12 21:46:21,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997072294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:21,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:21,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:46:21,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645617481] [2024-10-12 21:46:21,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:21,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:46:21,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:21,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:46:21,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:46:21,915 INFO L87 Difference]: Start difference. First operand 163 states and 252 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:22,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:22,750 INFO L93 Difference]: Finished difference Result 570 states and 906 transitions. [2024-10-12 21:46:22,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:46:22,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 21:46:22,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:22,754 INFO L225 Difference]: With dead ends: 570 [2024-10-12 21:46:22,754 INFO L226 Difference]: Without dead ends: 418 [2024-10-12 21:46:22,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:46:22,757 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 605 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:22,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 491 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:46:22,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-10-12 21:46:22,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 319. [2024-10-12 21:46:22,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 274 states have (on average 1.5766423357664234) internal successors, (432), 276 states have internal predecessors, (432), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2024-10-12 21:46:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 497 transitions. [2024-10-12 21:46:22,779 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 497 transitions. Word has length 81 [2024-10-12 21:46:22,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:22,780 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 497 transitions. [2024-10-12 21:46:22,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:22,780 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 497 transitions. [2024-10-12 21:46:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 21:46:22,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:22,783 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] [2024-10-12 21:46:22,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:46:22,783 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:22,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:22,784 INFO L85 PathProgramCache]: Analyzing trace with hash -919184092, now seen corresponding path program 1 times [2024-10-12 21:46:22,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:22,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295490529] [2024-10-12 21:46:22,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:22,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:22,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:22,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:46:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:22,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:46:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:22,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:46:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:22,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:46:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:22,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:22,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295490529] [2024-10-12 21:46:22,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295490529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:22,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:22,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:22,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798197705] [2024-10-12 21:46:22,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:22,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:22,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:22,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:22,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:22,919 INFO L87 Difference]: Start difference. First operand 319 states and 497 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:24,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:24,024 INFO L93 Difference]: Finished difference Result 935 states and 1480 transitions. [2024-10-12 21:46:24,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:46:24,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 21:46:24,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:24,028 INFO L225 Difference]: With dead ends: 935 [2024-10-12 21:46:24,028 INFO L226 Difference]: Without dead ends: 627 [2024-10-12 21:46:24,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:46:24,029 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 608 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:24,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 916 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:46:24,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-10-12 21:46:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 464. [2024-10-12 21:46:24,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 399 states have (on average 1.568922305764411) internal successors, (626), 402 states have internal predecessors, (626), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-10-12 21:46:24,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 719 transitions. [2024-10-12 21:46:24,055 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 719 transitions. Word has length 81 [2024-10-12 21:46:24,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:24,056 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 719 transitions. [2024-10-12 21:46:24,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 719 transitions. [2024-10-12 21:46:24,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 21:46:24,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:24,057 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] [2024-10-12 21:46:24,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:46:24,057 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:24,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:24,057 INFO L85 PathProgramCache]: Analyzing trace with hash -2135337818, now seen corresponding path program 1 times [2024-10-12 21:46:24,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:24,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040688216] [2024-10-12 21:46:24,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:24,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:24,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:24,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:46:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:24,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:46:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:24,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:46:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:24,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:46:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:24,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:24,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040688216] [2024-10-12 21:46:24,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040688216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:24,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:24,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:24,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256527047] [2024-10-12 21:46:24,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:24,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:24,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:24,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:24,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:24,169 INFO L87 Difference]: Start difference. First operand 464 states and 719 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:25,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:25,297 INFO L93 Difference]: Finished difference Result 1469 states and 2318 transitions. [2024-10-12 21:46:25,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:46:25,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 21:46:25,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:25,302 INFO L225 Difference]: With dead ends: 1469 [2024-10-12 21:46:25,302 INFO L226 Difference]: Without dead ends: 1016 [2024-10-12 21:46:25,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:46:25,304 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 606 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:25,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 914 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:46:25,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2024-10-12 21:46:25,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 755. [2024-10-12 21:46:25,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 650 states have (on average 1.5615384615384615) internal successors, (1015), 655 states have internal predecessors, (1015), 70 states have call successors, (70), 30 states have call predecessors, (70), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-12 21:46:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1168 transitions. [2024-10-12 21:46:25,356 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1168 transitions. Word has length 81 [2024-10-12 21:46:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:25,356 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1168 transitions. [2024-10-12 21:46:25,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:25,357 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1168 transitions. [2024-10-12 21:46:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 21:46:25,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:25,358 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] [2024-10-12 21:46:25,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:46:25,358 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:25,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:25,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1427662052, now seen corresponding path program 1 times [2024-10-12 21:46:25,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:25,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267509908] [2024-10-12 21:46:25,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:25,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:25,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:25,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:46:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:25,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:46:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:25,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:46:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:25,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:46:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:25,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:25,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267509908] [2024-10-12 21:46:25,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267509908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:25,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:25,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:25,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834352627] [2024-10-12 21:46:25,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:25,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:25,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:25,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:25,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:25,458 INFO L87 Difference]: Start difference. First operand 755 states and 1168 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:26,475 INFO L93 Difference]: Finished difference Result 2496 states and 3927 transitions. [2024-10-12 21:46:26,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:46:26,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 21:46:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:26,483 INFO L225 Difference]: With dead ends: 2496 [2024-10-12 21:46:26,483 INFO L226 Difference]: Without dead ends: 1752 [2024-10-12 21:46:26,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:46:26,485 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 653 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:26,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 612 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:46:26,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2024-10-12 21:46:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1338. [2024-10-12 21:46:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 1153 states have (on average 1.5550737207285343) internal successors, (1793), 1162 states have internal predecessors, (1793), 122 states have call successors, (122), 54 states have call predecessors, (122), 62 states have return successors, (157), 129 states have call predecessors, (157), 122 states have call successors, (157) [2024-10-12 21:46:26,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 2072 transitions. [2024-10-12 21:46:26,596 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 2072 transitions. Word has length 81 [2024-10-12 21:46:26,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:26,597 INFO L471 AbstractCegarLoop]: Abstraction has 1338 states and 2072 transitions. [2024-10-12 21:46:26,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:26,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 2072 transitions. [2024-10-12 21:46:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 21:46:26,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:26,598 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] [2024-10-12 21:46:26,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:46:26,598 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:26,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:26,599 INFO L85 PathProgramCache]: Analyzing trace with hash -258517786, now seen corresponding path program 1 times [2024-10-12 21:46:26,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:26,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764423976] [2024-10-12 21:46:26,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:26,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:26,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:26,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:46:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:26,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:46:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:26,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:46:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:26,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:46:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:26,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:26,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764423976] [2024-10-12 21:46:26,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764423976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:26,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:26,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:26,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388916176] [2024-10-12 21:46:26,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:26,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:26,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:26,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:26,722 INFO L87 Difference]: Start difference. First operand 1338 states and 2072 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:28,044 INFO L93 Difference]: Finished difference Result 4549 states and 7161 transitions. [2024-10-12 21:46:28,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:46:28,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 21:46:28,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:28,066 INFO L225 Difference]: With dead ends: 4549 [2024-10-12 21:46:28,070 INFO L226 Difference]: Without dead ends: 3222 [2024-10-12 21:46:28,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:46:28,078 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 604 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:28,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 914 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:46:28,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3222 states. [2024-10-12 21:46:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3222 to 2509. [2024-10-12 21:46:28,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 2164 states have (on average 1.5503696857670979) internal successors, (3355), 2181 states have internal predecessors, (3355), 226 states have call successors, (226), 102 states have call predecessors, (226), 118 states have return successors, (323), 241 states have call predecessors, (323), 226 states have call successors, (323) [2024-10-12 21:46:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3904 transitions. [2024-10-12 21:46:28,384 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3904 transitions. Word has length 81 [2024-10-12 21:46:28,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:28,384 INFO L471 AbstractCegarLoop]: Abstraction has 2509 states and 3904 transitions. [2024-10-12 21:46:28,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3904 transitions. [2024-10-12 21:46:28,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 21:46:28,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:28,387 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] [2024-10-12 21:46:28,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:46:28,388 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:28,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:28,388 INFO L85 PathProgramCache]: Analyzing trace with hash -312910684, now seen corresponding path program 1 times [2024-10-12 21:46:28,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:28,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072861693] [2024-10-12 21:46:28,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:28,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:28,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:28,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:46:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:28,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:46:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:28,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:46:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:28,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:46:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:28,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:28,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072861693] [2024-10-12 21:46:28,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072861693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:28,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:28,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:28,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869213173] [2024-10-12 21:46:28,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:28,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:28,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:28,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:28,505 INFO L87 Difference]: Start difference. First operand 2509 states and 3904 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:29,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:29,935 INFO L93 Difference]: Finished difference Result 9359 states and 14797 transitions. [2024-10-12 21:46:29,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:46:29,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 21:46:29,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:29,964 INFO L225 Difference]: With dead ends: 9359 [2024-10-12 21:46:29,964 INFO L226 Difference]: Without dead ends: 6861 [2024-10-12 21:46:29,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:46:29,974 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 718 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:29,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 903 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:46:29,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6861 states. [2024-10-12 21:46:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6861 to 4769. [2024-10-12 21:46:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4769 states, 4120 states have (on average 1.5502427184466019) internal successors, (6387), 4153 states have internal predecessors, (6387), 418 states have call successors, (418), 198 states have call predecessors, (418), 230 states have return successors, (693), 449 states have call predecessors, (693), 418 states have call successors, (693) [2024-10-12 21:46:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4769 states to 4769 states and 7498 transitions. [2024-10-12 21:46:30,374 INFO L78 Accepts]: Start accepts. Automaton has 4769 states and 7498 transitions. Word has length 81 [2024-10-12 21:46:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:30,374 INFO L471 AbstractCegarLoop]: Abstraction has 4769 states and 7498 transitions. [2024-10-12 21:46:30,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:30,375 INFO L276 IsEmpty]: Start isEmpty. Operand 4769 states and 7498 transitions. [2024-10-12 21:46:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 21:46:30,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:30,382 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] [2024-10-12 21:46:30,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:46:30,382 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:30,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:30,382 INFO L85 PathProgramCache]: Analyzing trace with hash 366361570, now seen corresponding path program 1 times [2024-10-12 21:46:30,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:30,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722465760] [2024-10-12 21:46:30,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:30,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:30,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:30,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:46:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:30,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:46:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:30,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:46:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:30,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:46:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:30,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:30,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722465760] [2024-10-12 21:46:30,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722465760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:30,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:30,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:30,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329134272] [2024-10-12 21:46:30,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:30,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:30,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:30,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:30,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:30,506 INFO L87 Difference]: Start difference. First operand 4769 states and 7498 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:32,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:32,352 INFO L93 Difference]: Finished difference Result 17605 states and 28049 transitions. [2024-10-12 21:46:32,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:46:32,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 21:46:32,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:32,401 INFO L225 Difference]: With dead ends: 17605 [2024-10-12 21:46:32,402 INFO L226 Difference]: Without dead ends: 12847 [2024-10-12 21:46:32,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:46:32,415 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 619 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:32,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 907 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:46:32,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12847 states. [2024-10-12 21:46:33,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12847 to 9366. [2024-10-12 21:46:33,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9366 states, 8125 states have (on average 1.5513846153846154) internal successors, (12605), 8190 states have internal predecessors, (12605), 786 states have call successors, (786), 390 states have call predecessors, (786), 454 states have return successors, (1579), 849 states have call predecessors, (1579), 786 states have call successors, (1579) [2024-10-12 21:46:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9366 states to 9366 states and 14970 transitions. [2024-10-12 21:46:33,320 INFO L78 Accepts]: Start accepts. Automaton has 9366 states and 14970 transitions. Word has length 81 [2024-10-12 21:46:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:33,321 INFO L471 AbstractCegarLoop]: Abstraction has 9366 states and 14970 transitions. [2024-10-12 21:46:33,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 9366 states and 14970 transitions. [2024-10-12 21:46:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 21:46:33,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:33,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:33,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:46:33,328 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:33,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:33,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1967031068, now seen corresponding path program 1 times [2024-10-12 21:46:33,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:33,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049313080] [2024-10-12 21:46:33,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:33,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:33,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:33,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:46:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:33,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:46:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:33,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:46:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:33,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:46:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:33,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:33,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049313080] [2024-10-12 21:46:33,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049313080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:33,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:33,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:33,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529971750] [2024-10-12 21:46:33,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:33,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:33,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:33,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:33,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:33,441 INFO L87 Difference]: Start difference. First operand 9366 states and 14970 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:36,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:36,435 INFO L93 Difference]: Finished difference Result 33824 states and 54719 transitions. [2024-10-12 21:46:36,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:46:36,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 21:46:36,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:36,511 INFO L225 Difference]: With dead ends: 33824 [2024-10-12 21:46:36,511 INFO L226 Difference]: Without dead ends: 24469 [2024-10-12 21:46:36,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:46:36,536 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 647 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:36,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 907 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:46:36,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24469 states. [2024-10-12 21:46:37,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24469 to 18559. [2024-10-12 21:46:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18559 states, 16166 states have (on average 1.5528269206977607) internal successors, (25103), 16295 states have internal predecessors, (25103), 1490 states have call successors, (1490), 774 states have call predecessors, (1490), 902 states have return successors, (3805), 1617 states have call predecessors, (3805), 1490 states have call successors, (3805) [2024-10-12 21:46:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18559 states to 18559 states and 30398 transitions. [2024-10-12 21:46:37,888 INFO L78 Accepts]: Start accepts. Automaton has 18559 states and 30398 transitions. Word has length 81 [2024-10-12 21:46:37,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:37,888 INFO L471 AbstractCegarLoop]: Abstraction has 18559 states and 30398 transitions. [2024-10-12 21:46:37,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:37,889 INFO L276 IsEmpty]: Start isEmpty. Operand 18559 states and 30398 transitions. [2024-10-12 21:46:37,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 21:46:37,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:37,905 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] [2024-10-12 21:46:37,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:46:37,905 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:37,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:37,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1765207134, now seen corresponding path program 1 times [2024-10-12 21:46:37,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:37,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228638177] [2024-10-12 21:46:37,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:37,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:37,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:37,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:46:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:38,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:46:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:38,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:46:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:38,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:46:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:38,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:38,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:38,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228638177] [2024-10-12 21:46:38,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228638177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:38,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:38,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:38,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013272527] [2024-10-12 21:46:38,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:38,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:38,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:38,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:38,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:38,031 INFO L87 Difference]: Start difference. First operand 18559 states and 30398 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:42,915 INFO L93 Difference]: Finished difference Result 65303 states and 108341 transitions. [2024-10-12 21:46:42,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:46:42,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 21:46:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:43,084 INFO L225 Difference]: With dead ends: 65303 [2024-10-12 21:46:43,084 INFO L226 Difference]: Without dead ends: 46755 [2024-10-12 21:46:43,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:46:43,134 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 608 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:43,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 907 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:46:43,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46755 states. [2024-10-12 21:46:46,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46755 to 36944. [2024-10-12 21:46:46,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36944 states, 32311 states have (on average 1.554424189904367) internal successors, (50225), 32568 states have internal predecessors, (50225), 2834 states have call successors, (2834), 1542 states have call predecessors, (2834), 1798 states have return successors, (9651), 3089 states have call predecessors, (9651), 2834 states have call successors, (9651) [2024-10-12 21:46:46,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36944 states to 36944 states and 62710 transitions. [2024-10-12 21:46:46,606 INFO L78 Accepts]: Start accepts. Automaton has 36944 states and 62710 transitions. Word has length 81 [2024-10-12 21:46:46,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:46,606 INFO L471 AbstractCegarLoop]: Abstraction has 36944 states and 62710 transitions. [2024-10-12 21:46:46,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:46,606 INFO L276 IsEmpty]: Start isEmpty. Operand 36944 states and 62710 transitions. [2024-10-12 21:46:46,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 21:46:46,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:46,629 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] [2024-10-12 21:46:46,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:46:46,629 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:46,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:46,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1204507356, now seen corresponding path program 1 times [2024-10-12 21:46:46,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:46,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279190902] [2024-10-12 21:46:46,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:46,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:46,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:46,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:46:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:46,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:46:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:46,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:46:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:46,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:46:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:46,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:46,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279190902] [2024-10-12 21:46:46,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279190902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:46,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:46,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:46:46,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983780767] [2024-10-12 21:46:46,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:46,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:46:46,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:46,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:46:46,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:46:46,706 INFO L87 Difference]: Start difference. First operand 36944 states and 62710 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:50,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:50,387 INFO L93 Difference]: Finished difference Result 82391 states and 139610 transitions. [2024-10-12 21:46:50,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:46:50,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 21:46:50,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:50,556 INFO L225 Difference]: With dead ends: 82391 [2024-10-12 21:46:50,556 INFO L226 Difference]: Without dead ends: 45459 [2024-10-12 21:46:50,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:46:50,639 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 206 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:50,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 528 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:46:50,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45459 states. [2024-10-12 21:46:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45459 to 37458. [2024-10-12 21:46:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37458 states, 32825 states have (on average 1.5457425742574258) internal successors, (50739), 33082 states have internal predecessors, (50739), 2834 states have call successors, (2834), 1542 states have call predecessors, (2834), 1798 states have return successors, (9651), 3089 states have call predecessors, (9651), 2834 states have call successors, (9651) [2024-10-12 21:46:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37458 states to 37458 states and 63224 transitions. [2024-10-12 21:46:53,866 INFO L78 Accepts]: Start accepts. Automaton has 37458 states and 63224 transitions. Word has length 81 [2024-10-12 21:46:53,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:53,866 INFO L471 AbstractCegarLoop]: Abstraction has 37458 states and 63224 transitions. [2024-10-12 21:46:53,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 37458 states and 63224 transitions. [2024-10-12 21:46:53,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 21:46:53,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:53,889 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] [2024-10-12 21:46:53,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:46:53,890 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:53,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:53,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1061873830, now seen corresponding path program 1 times [2024-10-12 21:46:53,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:53,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992937578] [2024-10-12 21:46:53,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:53,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:53,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:53,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 21:46:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:53,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 21:46:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:54,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 21:46:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:54,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:46:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:54,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:54,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992937578] [2024-10-12 21:46:54,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992937578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:54,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:54,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:54,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103398877] [2024-10-12 21:46:54,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:54,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:54,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:54,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:54,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:54,049 INFO L87 Difference]: Start difference. First operand 37458 states and 63224 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:47:04,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:04,210 INFO L93 Difference]: Finished difference Result 167261 states and 283818 transitions. [2024-10-12 21:47:04,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 21:47:04,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 21:47:04,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:05,109 INFO L225 Difference]: With dead ends: 167261 [2024-10-12 21:47:05,110 INFO L226 Difference]: Without dead ends: 129815 [2024-10-12 21:47:05,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-12 21:47:05,232 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 1621 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1642 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:05,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1642 Valid, 761 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:47:05,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129815 states.