./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c3aab1156afcb98b97b027e9b66004d54025f3b89e95d6d35dc2e84fdb640d2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:55:41,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:55:41,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:55:41,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:55:41,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:55:41,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:55:41,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:55:41,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:55:41,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:55:41,713 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:55:41,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:55:41,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:55:41,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:55:41,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:55:41,715 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:55:41,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:55:41,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:55:41,716 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:55:41,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:55:41,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:55:41,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:55:41,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:55:41,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:55:41,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:55:41,726 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:55:41,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:55:41,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:55:41,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:55:41,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:55:41,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:55:41,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:55:41,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:55:41,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:55:41,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:55:41,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:55:41,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:55:41,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:55:41,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:55:41,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:55:41,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:55:41,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:55:41,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:55:41,734 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 -> 4c3aab1156afcb98b97b027e9b66004d54025f3b89e95d6d35dc2e84fdb640d2 [2024-11-11 22:55:42,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:55:42,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:55:42,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:55:42,095 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:55:42,095 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:55:42,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2024-11-11 22:55:43,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:55:43,648 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:55:43,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2024-11-11 22:55:43,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5401c99a/aafc54c957664d87b52d283ebfd32141/FLAGbb54c7fd4 [2024-11-11 22:55:44,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5401c99a/aafc54c957664d87b52d283ebfd32141 [2024-11-11 22:55:44,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:55:44,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:55:44,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:55:44,036 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:55:44,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:55:44,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:55:44" (1/1) ... [2024-11-11 22:55:44,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7079d0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:44, skipping insertion in model container [2024-11-11 22:55:44,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:55:44" (1/1) ... [2024-11-11 22:55:44,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:55:44,214 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[914,927] [2024-11-11 22:55:44,279 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[7115,7128] [2024-11-11 22:55:44,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:55:44,389 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:55:44,418 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[914,927] [2024-11-11 22:55:44,438 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[7115,7128] [2024-11-11 22:55:44,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:55:44,474 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:55:44,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:44 WrapperNode [2024-11-11 22:55:44,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:55:44,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:55:44,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:55:44,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:55:44,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:44" (1/1) ... [2024-11-11 22:55:44,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:44" (1/1) ... [2024-11-11 22:55:44,521 INFO L138 Inliner]: procedures = 59, calls = 66, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 528 [2024-11-11 22:55:44,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:55:44,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:55:44,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:55:44,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:55:44,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:44" (1/1) ... [2024-11-11 22:55:44,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:44" (1/1) ... [2024-11-11 22:55:44,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:44" (1/1) ... [2024-11-11 22:55:44,556 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 22:55:44,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:44" (1/1) ... [2024-11-11 22:55:44,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:44" (1/1) ... [2024-11-11 22:55:44,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:44" (1/1) ... [2024-11-11 22:55:44,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:44" (1/1) ... [2024-11-11 22:55:44,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:44" (1/1) ... [2024-11-11 22:55:44,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:44" (1/1) ... [2024-11-11 22:55:44,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:55:44,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:55:44,578 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:55:44,578 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:55:44,579 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:44" (1/1) ... [2024-11-11 22:55:44,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:55:44,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:55:44,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:55:44,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:55:44,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:55:44,657 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:55:44,657 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:55:44,658 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-11 22:55:44,659 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-11 22:55:44,659 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-11 22:55:44,660 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-11 22:55:44,660 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-11 22:55:44,660 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-11 22:55:44,660 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-11 22:55:44,660 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-11 22:55:44,660 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-11 22:55:44,660 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-11 22:55:44,660 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-11 22:55:44,660 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-11 22:55:44,661 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-11 22:55:44,661 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-11 22:55:44,661 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-11 22:55:44,661 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-11 22:55:44,661 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-11 22:55:44,662 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-11 22:55:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-11 22:55:44,662 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-11 22:55:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:55:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-11 22:55:44,663 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-11 22:55:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-11 22:55:44,663 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-11 22:55:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:55:44,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:55:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-11 22:55:44,663 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-11 22:55:44,765 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:55:44,768 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:55:45,235 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-11 22:55:45,235 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:55:45,254 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:55:45,255 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-11 22:55:45,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:55:45 BoogieIcfgContainer [2024-11-11 22:55:45,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:55:45,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:55:45,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:55:45,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:55:45,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:55:44" (1/3) ... [2024-11-11 22:55:45,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3964fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:55:45, skipping insertion in model container [2024-11-11 22:55:45,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:44" (2/3) ... [2024-11-11 22:55:45,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3964fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:55:45, skipping insertion in model container [2024-11-11 22:55:45,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:55:45" (3/3) ... [2024-11-11 22:55:45,262 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2024-11-11 22:55:45,275 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:55:45,276 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:55:45,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:55:45,332 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;@25a0d346, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:55:45,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:55:45,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 262 states, 214 states have (on average 1.560747663551402) internal successors, (334), 220 states have internal predecessors, (334), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-11 22:55:45,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:55:45,346 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:45,347 INFO L218 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] [2024-11-11 22:55:45,347 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:45,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:45,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1308412367, now seen corresponding path program 1 times [2024-11-11 22:55:45,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:45,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602080191] [2024-11-11 22:55:45,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:45,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:45,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:45,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:55:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:45,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:55:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:45,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:55:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:45,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:45,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:55:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:45,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:55:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:45,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:45,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602080191] [2024-11-11 22:55:45,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602080191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:45,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:45,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:55:45,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232594689] [2024-11-11 22:55:45,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:45,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:55:45,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:45,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:55:45,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:55:45,863 INFO L87 Difference]: Start difference. First operand has 262 states, 214 states have (on average 1.560747663551402) internal successors, (334), 220 states have internal predecessors, (334), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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-11-11 22:55:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:46,813 INFO L93 Difference]: Finished difference Result 640 states and 968 transitions. [2024-11-11 22:55:46,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:55:46,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2024-11-11 22:55:46,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:46,825 INFO L225 Difference]: With dead ends: 640 [2024-11-11 22:55:46,825 INFO L226 Difference]: Without dead ends: 387 [2024-11-11 22:55:46,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:55:46,831 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 857 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:46,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 925 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:55:46,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-11 22:55:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 348. [2024-11-11 22:55:46,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 282 states have (on average 1.4432624113475176) internal successors, (407), 288 states have internal predecessors, (407), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2024-11-11 22:55:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 494 transitions. [2024-11-11 22:55:46,892 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 494 transitions. Word has length 65 [2024-11-11 22:55:46,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:46,892 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 494 transitions. [2024-11-11 22:55:46,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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-11-11 22:55:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 494 transitions. [2024-11-11 22:55:46,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:55:46,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:46,895 INFO L218 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] [2024-11-11 22:55:46,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:55:46,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:46,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:46,896 INFO L85 PathProgramCache]: Analyzing trace with hash -904626416, now seen corresponding path program 1 times [2024-11-11 22:55:46,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:46,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144536885] [2024-11-11 22:55:46,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:46,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:46,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:46,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:55:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:47,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:55:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:47,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:55:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:47,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:47,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:55:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:47,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:55:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:47,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:47,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144536885] [2024-11-11 22:55:47,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144536885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:47,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:47,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:55:47,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661129640] [2024-11-11 22:55:47,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:47,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:55:47,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:47,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:55:47,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:55:47,039 INFO L87 Difference]: Start difference. First operand 348 states and 494 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-11-11 22:55:47,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:47,806 INFO L93 Difference]: Finished difference Result 695 states and 971 transitions. [2024-11-11 22:55:47,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 22:55:47,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2024-11-11 22:55:47,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:47,810 INFO L225 Difference]: With dead ends: 695 [2024-11-11 22:55:47,810 INFO L226 Difference]: Without dead ends: 518 [2024-11-11 22:55:47,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-11 22:55:47,812 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 897 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:47,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1135 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:55:47,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-11 22:55:47,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 444. [2024-11-11 22:55:47,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 358 states have (on average 1.4273743016759777) internal successors, (511), 366 states have internal predecessors, (511), 53 states have call successors, (53), 28 states have call predecessors, (53), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2024-11-11 22:55:47,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 628 transitions. [2024-11-11 22:55:47,871 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 628 transitions. Word has length 65 [2024-11-11 22:55:47,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:47,871 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 628 transitions. [2024-11-11 22:55:47,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-11-11 22:55:47,871 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 628 transitions. [2024-11-11 22:55:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:55:47,873 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:47,873 INFO L218 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] [2024-11-11 22:55:47,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:55:47,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:47,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:47,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1361754770, now seen corresponding path program 1 times [2024-11-11 22:55:47,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:47,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311922828] [2024-11-11 22:55:47,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:47,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:47,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:47,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:55:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:47,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:55:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:48,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:55:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:48,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:48,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:55:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:48,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:55:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:48,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:48,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311922828] [2024-11-11 22:55:48,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311922828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:48,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:48,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:55:48,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199526210] [2024-11-11 22:55:48,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:48,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:55:48,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:48,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:55:48,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:55:48,066 INFO L87 Difference]: Start difference. First operand 444 states and 628 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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-11-11 22:55:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:48,964 INFO L93 Difference]: Finished difference Result 743 states and 1039 transitions. [2024-11-11 22:55:48,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:55:48,965 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2024-11-11 22:55:48,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:48,974 INFO L225 Difference]: With dead ends: 743 [2024-11-11 22:55:48,974 INFO L226 Difference]: Without dead ends: 476 [2024-11-11 22:55:48,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:55:48,976 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 288 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:48,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1456 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:55:48,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-11 22:55:48,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 449. [2024-11-11 22:55:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 362 states have (on average 1.4171270718232045) internal successors, (513), 370 states have internal predecessors, (513), 53 states have call successors, (53), 28 states have call predecessors, (53), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2024-11-11 22:55:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 631 transitions. [2024-11-11 22:55:48,999 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 631 transitions. Word has length 65 [2024-11-11 22:55:49,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:49,000 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 631 transitions. [2024-11-11 22:55:49,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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-11-11 22:55:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 631 transitions. [2024-11-11 22:55:49,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:55:49,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:49,001 INFO L218 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] [2024-11-11 22:55:49,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:55:49,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:49,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:49,002 INFO L85 PathProgramCache]: Analyzing trace with hash 332395472, now seen corresponding path program 1 times [2024-11-11 22:55:49,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:49,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205657733] [2024-11-11 22:55:49,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:49,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:49,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:49,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:55:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:49,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:55:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:49,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:55:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:49,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:49,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:55:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:49,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:55:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:49,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:49,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205657733] [2024-11-11 22:55:49,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205657733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:49,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:49,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:55:49,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262866185] [2024-11-11 22:55:49,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:49,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:55:49,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:49,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:55:49,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:55:49,108 INFO L87 Difference]: Start difference. First operand 449 states and 631 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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-11-11 22:55:49,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:49,737 INFO L93 Difference]: Finished difference Result 765 states and 1061 transitions. [2024-11-11 22:55:49,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 22:55:49,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2024-11-11 22:55:49,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:49,740 INFO L225 Difference]: With dead ends: 765 [2024-11-11 22:55:49,740 INFO L226 Difference]: Without dead ends: 493 [2024-11-11 22:55:49,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:55:49,745 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 291 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:49,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1454 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:55:49,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-11 22:55:49,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 464. [2024-11-11 22:55:49,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 374 states have (on average 1.4037433155080214) internal successors, (525), 382 states have internal predecessors, (525), 53 states have call successors, (53), 28 states have call predecessors, (53), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2024-11-11 22:55:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 646 transitions. [2024-11-11 22:55:49,799 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 646 transitions. Word has length 65 [2024-11-11 22:55:49,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:49,800 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 646 transitions. [2024-11-11 22:55:49,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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-11-11 22:55:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 646 transitions. [2024-11-11 22:55:49,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:55:49,801 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:49,801 INFO L218 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] [2024-11-11 22:55:49,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:55:49,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:49,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:49,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1718598866, now seen corresponding path program 1 times [2024-11-11 22:55:49,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:49,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753148931] [2024-11-11 22:55:49,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:49,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:49,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:49,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:55:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:49,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:55:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:49,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:55:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:49,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:49,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:55:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:49,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:55:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:49,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:49,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753148931] [2024-11-11 22:55:49,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753148931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:49,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:49,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:55:49,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637711689] [2024-11-11 22:55:49,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:49,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:55:49,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:49,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:55:49,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:55:49,941 INFO L87 Difference]: Start difference. First operand 464 states and 646 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-11-11 22:55:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:50,678 INFO L93 Difference]: Finished difference Result 856 states and 1157 transitions. [2024-11-11 22:55:50,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 22:55:50,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2024-11-11 22:55:50,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:50,681 INFO L225 Difference]: With dead ends: 856 [2024-11-11 22:55:50,681 INFO L226 Difference]: Without dead ends: 571 [2024-11-11 22:55:50,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-11 22:55:50,683 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 722 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:50,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1114 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:55:50,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-11-11 22:55:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 476. [2024-11-11 22:55:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 384 states have (on average 1.3932291666666667) internal successors, (535), 392 states have internal predecessors, (535), 54 states have call successors, (54), 29 states have call predecessors, (54), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2024-11-11 22:55:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 656 transitions. [2024-11-11 22:55:50,707 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 656 transitions. Word has length 65 [2024-11-11 22:55:50,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:50,707 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 656 transitions. [2024-11-11 22:55:50,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-11-11 22:55:50,708 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 656 transitions. [2024-11-11 22:55:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:55:50,708 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:50,708 INFO L218 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] [2024-11-11 22:55:50,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:55:50,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:50,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:50,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1584585360, now seen corresponding path program 1 times [2024-11-11 22:55:50,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:50,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959657013] [2024-11-11 22:55:50,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:50,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:50,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:50,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:55:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:50,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:55:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:50,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:55:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:50,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:50,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:55:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:50,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:55:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:50,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:50,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:50,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959657013] [2024-11-11 22:55:50,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959657013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:50,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:50,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:50,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850583905] [2024-11-11 22:55:50,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:50,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:50,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:50,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:50,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:50,857 INFO L87 Difference]: Start difference. First operand 476 states and 656 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:55:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:51,408 INFO L93 Difference]: Finished difference Result 1118 states and 1503 transitions. [2024-11-11 22:55:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 22:55:51,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-11 22:55:51,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:51,413 INFO L225 Difference]: With dead ends: 1118 [2024-11-11 22:55:51,413 INFO L226 Difference]: Without dead ends: 822 [2024-11-11 22:55:51,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:55:51,417 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 871 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:51,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 737 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:55:51,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-11-11 22:55:51,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 766. [2024-11-11 22:55:51,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 608 states have (on average 1.3519736842105263) internal successors, (822), 623 states have internal predecessors, (822), 89 states have call successors, (89), 51 states have call predecessors, (89), 67 states have return successors, (124), 98 states have call predecessors, (124), 87 states have call successors, (124) [2024-11-11 22:55:51,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1035 transitions. [2024-11-11 22:55:51,467 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1035 transitions. Word has length 65 [2024-11-11 22:55:51,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:51,467 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1035 transitions. [2024-11-11 22:55:51,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:55:51,468 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1035 transitions. [2024-11-11 22:55:51,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 22:55:51,472 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:51,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:51,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:55:51,473 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:51,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:51,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1734272765, now seen corresponding path program 1 times [2024-11-11 22:55:51,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:51,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014112149] [2024-11-11 22:55:51,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:51,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:51,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:51,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:55:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:51,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:55:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:51,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:55:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:51,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:51,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:55:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:51,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:55:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:51,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:51,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014112149] [2024-11-11 22:55:51,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014112149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:51,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:51,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:55:51,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005784214] [2024-11-11 22:55:51,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:51,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:55:51,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:51,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:55:51,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:55:51,554 INFO L87 Difference]: Start difference. First operand 766 states and 1035 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:55:52,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:52,025 INFO L93 Difference]: Finished difference Result 1969 states and 2606 transitions. [2024-11-11 22:55:52,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:55:52,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-11 22:55:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:52,031 INFO L225 Difference]: With dead ends: 1969 [2024-11-11 22:55:52,031 INFO L226 Difference]: Without dead ends: 1362 [2024-11-11 22:55:52,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:55:52,033 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 661 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:52,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 690 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 22:55:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2024-11-11 22:55:52,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1247. [2024-11-11 22:55:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 987 states have (on average 1.32016210739615) internal successors, (1303), 1005 states have internal predecessors, (1303), 134 states have call successors, (134), 95 states have call predecessors, (134), 124 states have return successors, (196), 153 states have call predecessors, (196), 132 states have call successors, (196) [2024-11-11 22:55:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1633 transitions. [2024-11-11 22:55:52,099 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1633 transitions. Word has length 66 [2024-11-11 22:55:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:52,100 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 1633 transitions. [2024-11-11 22:55:52,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:55:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1633 transitions. [2024-11-11 22:55:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 22:55:52,102 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:52,102 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:52,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:55:52,102 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:52,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash -276033106, now seen corresponding path program 1 times [2024-11-11 22:55:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:52,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178628627] [2024-11-11 22:55:52,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:52,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:52,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:52,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:55:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:52,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:55:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:52,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:55:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:52,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:52,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:55:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:52,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:55:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:52,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:52,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178628627] [2024-11-11 22:55:52,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178628627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:52,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:52,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:55:52,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902137010] [2024-11-11 22:55:52,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:52,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:55:52,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:52,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:55:52,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:55:52,154 INFO L87 Difference]: Start difference. First operand 1247 states and 1633 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:55:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:52,682 INFO L93 Difference]: Finished difference Result 3435 states and 4439 transitions. [2024-11-11 22:55:52,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 22:55:52,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-11 22:55:52,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:52,692 INFO L225 Difference]: With dead ends: 3435 [2024-11-11 22:55:52,692 INFO L226 Difference]: Without dead ends: 2367 [2024-11-11 22:55:52,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-11 22:55:52,695 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 871 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:52,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 576 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:55:52,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2024-11-11 22:55:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2109. [2024-11-11 22:55:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2109 states, 1653 states have (on average 1.2885662431941924) internal successors, (2130), 1681 states have internal predecessors, (2130), 232 states have call successors, (232), 179 states have call predecessors, (232), 222 states have return successors, (332), 255 states have call predecessors, (332), 230 states have call successors, (332) [2024-11-11 22:55:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 2694 transitions. [2024-11-11 22:55:52,866 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 2694 transitions. Word has length 66 [2024-11-11 22:55:52,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:52,866 INFO L471 AbstractCegarLoop]: Abstraction has 2109 states and 2694 transitions. [2024-11-11 22:55:52,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:55:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2694 transitions. [2024-11-11 22:55:52,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 22:55:52,868 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:52,868 INFO L218 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] [2024-11-11 22:55:52,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:55:52,868 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:52,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:52,869 INFO L85 PathProgramCache]: Analyzing trace with hash -968522334, now seen corresponding path program 1 times [2024-11-11 22:55:52,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:52,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571181529] [2024-11-11 22:55:52,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:52,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:52,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:52,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:55:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:52,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:55:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:52,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:55:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:52,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:52,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:55:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:52,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:55:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:52,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:52,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571181529] [2024-11-11 22:55:52,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571181529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:52,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:52,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:55:52,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657224402] [2024-11-11 22:55:52,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:52,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:55:52,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:52,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:55:52,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:55:52,920 INFO L87 Difference]: Start difference. First operand 2109 states and 2694 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:55:53,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:53,466 INFO L93 Difference]: Finished difference Result 5019 states and 6344 transitions. [2024-11-11 22:55:53,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:55:53,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2024-11-11 22:55:53,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:53,478 INFO L225 Difference]: With dead ends: 5019 [2024-11-11 22:55:53,479 INFO L226 Difference]: Without dead ends: 3089 [2024-11-11 22:55:53,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:55:53,484 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 679 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:53,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 780 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 22:55:53,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2024-11-11 22:55:53,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 2841. [2024-11-11 22:55:53,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2221 states have (on average 1.2760018009905447) internal successors, (2834), 2257 states have internal predecessors, (2834), 312 states have call successors, (312), 249 states have call predecessors, (312), 306 states have return successors, (441), 341 states have call predecessors, (441), 310 states have call successors, (441) [2024-11-11 22:55:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 3587 transitions. [2024-11-11 22:55:53,674 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 3587 transitions. Word has length 72 [2024-11-11 22:55:53,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:53,675 INFO L471 AbstractCegarLoop]: Abstraction has 2841 states and 3587 transitions. [2024-11-11 22:55:53,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:55:53,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 3587 transitions. [2024-11-11 22:55:53,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-11 22:55:53,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:53,676 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:53,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:55:53,677 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:53,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:53,677 INFO L85 PathProgramCache]: Analyzing trace with hash -475694546, now seen corresponding path program 1 times [2024-11-11 22:55:53,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:53,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138025032] [2024-11-11 22:55:53,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:53,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:53,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:53,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:55:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:53,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:55:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:53,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:55:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:53,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:53,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:55:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:53,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:55:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:53,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:53,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138025032] [2024-11-11 22:55:53,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138025032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:53,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:53,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:53,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926072823] [2024-11-11 22:55:53,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:53,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:53,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:53,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:53,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:53,740 INFO L87 Difference]: Start difference. First operand 2841 states and 3587 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 22:55:54,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:54,407 INFO L93 Difference]: Finished difference Result 3615 states and 4518 transitions. [2024-11-11 22:55:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 22:55:54,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2024-11-11 22:55:54,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:54,421 INFO L225 Difference]: With dead ends: 3615 [2024-11-11 22:55:54,422 INFO L226 Difference]: Without dead ends: 3612 [2024-11-11 22:55:54,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:55:54,424 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 1051 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:54,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 754 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:55:54,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3612 states. [2024-11-11 22:55:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3612 to 3335. [2024-11-11 22:55:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3335 states, 2606 states have (on average 1.2686108979278587) internal successors, (3306), 2647 states have internal predecessors, (3306), 362 states have call successors, (362), 293 states have call predecessors, (362), 365 states have return successors, (520), 401 states have call predecessors, (520), 361 states have call successors, (520) [2024-11-11 22:55:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 4188 transitions. [2024-11-11 22:55:54,688 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 4188 transitions. Word has length 73 [2024-11-11 22:55:54,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:54,688 INFO L471 AbstractCegarLoop]: Abstraction has 3335 states and 4188 transitions. [2024-11-11 22:55:54,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 22:55:54,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4188 transitions. [2024-11-11 22:55:54,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 22:55:54,689 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:54,689 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:54,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:55:54,690 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:54,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:54,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1862406292, now seen corresponding path program 1 times [2024-11-11 22:55:54,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:54,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524568660] [2024-11-11 22:55:54,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:54,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:54,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:54,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:55:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:54,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:55:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:54,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:55:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:54,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:54,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:55:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:54,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:55:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:54,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:54,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:54,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524568660] [2024-11-11 22:55:54,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524568660] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:55:54,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051453098] [2024-11-11 22:55:54,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:54,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:55:54,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:55:54,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:55:54,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 22:55:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:54,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 22:55:54,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:55:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:55,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:55:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:55,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051453098] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:55:55,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:55:55,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-11-11 22:55:55,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591009101] [2024-11-11 22:55:55,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:55:55,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 22:55:55,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:55,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 22:55:55,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:55:55,392 INFO L87 Difference]: Start difference. First operand 3335 states and 4188 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-11 22:55:56,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:56,933 INFO L93 Difference]: Finished difference Result 7776 states and 9674 transitions. [2024-11-11 22:55:56,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 22:55:56,933 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2024-11-11 22:55:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:56,961 INFO L225 Difference]: With dead ends: 7776 [2024-11-11 22:55:56,961 INFO L226 Difference]: Without dead ends: 7773 [2024-11-11 22:55:56,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-11-11 22:55:56,966 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 1450 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:56,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1641 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 22:55:56,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7773 states. [2024-11-11 22:55:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7773 to 5125. [2024-11-11 22:55:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 4010 states have (on average 1.2673316708229427) internal successors, (5082), 4073 states have internal predecessors, (5082), 546 states have call successors, (546), 451 states have call predecessors, (546), 567 states have return successors, (798), 607 states have call predecessors, (798), 545 states have call successors, (798) [2024-11-11 22:55:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 6426 transitions. [2024-11-11 22:55:57,467 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 6426 transitions. Word has length 74 [2024-11-11 22:55:57,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:57,468 INFO L471 AbstractCegarLoop]: Abstraction has 5125 states and 6426 transitions. [2024-11-11 22:55:57,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-11 22:55:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 6426 transitions. [2024-11-11 22:55:57,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 22:55:57,470 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:57,470 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:57,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 22:55:57,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-11 22:55:57,675 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:57,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:57,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1528425426, now seen corresponding path program 2 times [2024-11-11 22:55:57,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:57,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404986614] [2024-11-11 22:55:57,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:57,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:57,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:57,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:55:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:57,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:55:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:57,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:55:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:57,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:57,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:55:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:57,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:55:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:57,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:57,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404986614] [2024-11-11 22:55:57,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404986614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:57,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:57,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:55:57,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139898997] [2024-11-11 22:55:57,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:57,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:55:57,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:57,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:55:57,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:55:57,741 INFO L87 Difference]: Start difference. First operand 5125 states and 6426 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 22:55:58,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:58,500 INFO L93 Difference]: Finished difference Result 7807 states and 9799 transitions. [2024-11-11 22:55:58,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:55:58,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2024-11-11 22:55:58,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:58,514 INFO L225 Difference]: With dead ends: 7807 [2024-11-11 22:55:58,514 INFO L226 Difference]: Without dead ends: 3732 [2024-11-11 22:55:58,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:55:58,521 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 739 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:58,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 679 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:55:58,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3732 states. [2024-11-11 22:55:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3732 to 3497. [2024-11-11 22:55:58,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3497 states, 2738 states have (on average 1.24981738495252) internal successors, (3422), 2779 states have internal predecessors, (3422), 378 states have call successors, (378), 307 states have call predecessors, (378), 379 states have return successors, (524), 417 states have call predecessors, (524), 377 states have call successors, (524) [2024-11-11 22:55:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3497 states to 3497 states and 4324 transitions. [2024-11-11 22:55:58,787 INFO L78 Accepts]: Start accepts. Automaton has 3497 states and 4324 transitions. Word has length 77 [2024-11-11 22:55:58,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:58,788 INFO L471 AbstractCegarLoop]: Abstraction has 3497 states and 4324 transitions. [2024-11-11 22:55:58,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 22:55:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3497 states and 4324 transitions. [2024-11-11 22:55:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:55:58,789 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:58,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:58,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:55:58,790 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:58,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:58,790 INFO L85 PathProgramCache]: Analyzing trace with hash 903920969, now seen corresponding path program 1 times [2024-11-11 22:55:58,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:58,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302984670] [2024-11-11 22:55:58,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:58,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:58,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:58,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:55:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:58,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:55:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:58,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:58,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:55:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:58,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:58,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302984670] [2024-11-11 22:55:58,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302984670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:58,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:58,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:55:58,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774870043] [2024-11-11 22:55:58,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:58,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:55:58,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:58,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:55:58,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:55:58,898 INFO L87 Difference]: Start difference. First operand 3497 states and 4324 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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-11-11 22:56:00,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:00,110 INFO L93 Difference]: Finished difference Result 3873 states and 4899 transitions. [2024-11-11 22:56:00,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:56:00,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2024-11-11 22:56:00,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:00,128 INFO L225 Difference]: With dead ends: 3873 [2024-11-11 22:56:00,128 INFO L226 Difference]: Without dead ends: 3728 [2024-11-11 22:56:00,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:56:00,135 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 748 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:00,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 760 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:56:00,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3728 states. [2024-11-11 22:56:00,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3728 to 3643. [2024-11-11 22:56:00,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3643 states, 2865 states have (on average 1.2610820244328098) internal successors, (3613), 2907 states have internal predecessors, (3613), 390 states have call successors, (390), 313 states have call predecessors, (390), 386 states have return successors, (539), 429 states have call predecessors, (539), 389 states have call successors, (539) [2024-11-11 22:56:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 4542 transitions. [2024-11-11 22:56:00,673 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 4542 transitions. Word has length 79 [2024-11-11 22:56:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:00,673 INFO L471 AbstractCegarLoop]: Abstraction has 3643 states and 4542 transitions. [2024-11-11 22:56:00,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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-11-11 22:56:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4542 transitions. [2024-11-11 22:56:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:00,675 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:00,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:00,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:56:00,676 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:00,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1140969165, now seen corresponding path program 1 times [2024-11-11 22:56:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:00,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051061894] [2024-11-11 22:56:00,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:00,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:00,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:00,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:00,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:00,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:00,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:00,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:00,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051061894] [2024-11-11 22:56:00,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051061894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:00,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:00,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:00,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664769400] [2024-11-11 22:56:00,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:00,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:00,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:00,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:00,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:00,803 INFO L87 Difference]: Start difference. First operand 3643 states and 4542 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:02,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:02,219 INFO L93 Difference]: Finished difference Result 4209 states and 5400 transitions. [2024-11-11 22:56:02,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:56:02,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:56:02,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:02,243 INFO L225 Difference]: With dead ends: 4209 [2024-11-11 22:56:02,243 INFO L226 Difference]: Without dead ends: 3918 [2024-11-11 22:56:02,248 INFO L434 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-11-11 22:56:02,248 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 745 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:02,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1276 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 22:56:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3918 states. [2024-11-11 22:56:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3918 to 3780. [2024-11-11 22:56:02,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3780 states, 2983 states have (on average 1.2691920885015084) internal successors, (3786), 3026 states have internal predecessors, (3786), 402 states have call successors, (402), 319 states have call predecessors, (402), 393 states have return successors, (553), 442 states have call predecessors, (553), 401 states have call successors, (553) [2024-11-11 22:56:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 4741 transitions. [2024-11-11 22:56:02,681 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 4741 transitions. Word has length 79 [2024-11-11 22:56:02,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:02,681 INFO L471 AbstractCegarLoop]: Abstraction has 3780 states and 4741 transitions. [2024-11-11 22:56:02,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 4741 transitions. [2024-11-11 22:56:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:02,684 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:02,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:02,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:56:02,684 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:02,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:02,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1086576267, now seen corresponding path program 1 times [2024-11-11 22:56:02,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:02,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142698433] [2024-11-11 22:56:02,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:02,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:02,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:02,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:02,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:02,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:02,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:02,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:02,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:02,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142698433] [2024-11-11 22:56:02,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142698433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:02,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:02,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:02,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882638513] [2024-11-11 22:56:02,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:02,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:02,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:02,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:02,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:02,786 INFO L87 Difference]: Start difference. First operand 3780 states and 4741 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:04,090 INFO L93 Difference]: Finished difference Result 4703 states and 6135 transitions. [2024-11-11 22:56:04,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:56:04,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:56:04,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:04,107 INFO L225 Difference]: With dead ends: 4703 [2024-11-11 22:56:04,107 INFO L226 Difference]: Without dead ends: 4275 [2024-11-11 22:56:04,111 INFO L434 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-11-11 22:56:04,112 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 743 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:04,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 1274 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:56:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2024-11-11 22:56:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4055. [2024-11-11 22:56:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4055 states, 3220 states have (on average 1.2835403726708075) internal successors, (4133), 3265 states have internal predecessors, (4133), 426 states have call successors, (426), 331 states have call predecessors, (426), 407 states have return successors, (585), 468 states have call predecessors, (585), 425 states have call successors, (585) [2024-11-11 22:56:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4055 states to 4055 states and 5144 transitions. [2024-11-11 22:56:04,571 INFO L78 Accepts]: Start accepts. Automaton has 4055 states and 5144 transitions. Word has length 79 [2024-11-11 22:56:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:04,572 INFO L471 AbstractCegarLoop]: Abstraction has 4055 states and 5144 transitions. [2024-11-11 22:56:04,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 4055 states and 5144 transitions. [2024-11-11 22:56:04,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:04,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:04,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:04,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:56:04,575 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:04,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:04,575 INFO L85 PathProgramCache]: Analyzing trace with hash 669179661, now seen corresponding path program 1 times [2024-11-11 22:56:04,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:04,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564292318] [2024-11-11 22:56:04,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:04,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:04,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:04,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:04,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:04,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:04,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:04,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:04,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564292318] [2024-11-11 22:56:04,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564292318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:04,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:04,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:04,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421748879] [2024-11-11 22:56:04,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:04,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:04,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:04,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:04,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:04,682 INFO L87 Difference]: Start difference. First operand 4055 states and 5144 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:05,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:05,798 INFO L93 Difference]: Finished difference Result 4968 states and 6531 transitions. [2024-11-11 22:56:05,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:56:05,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:56:05,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:05,811 INFO L225 Difference]: With dead ends: 4968 [2024-11-11 22:56:05,811 INFO L226 Difference]: Without dead ends: 4265 [2024-11-11 22:56:05,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:56:05,815 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 728 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:05,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 642 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:56:05,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4265 states. [2024-11-11 22:56:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4265 to 4055. [2024-11-11 22:56:06,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4055 states, 3220 states have (on average 1.2819875776397516) internal successors, (4128), 3265 states have internal predecessors, (4128), 426 states have call successors, (426), 331 states have call predecessors, (426), 407 states have return successors, (585), 468 states have call predecessors, (585), 425 states have call successors, (585) [2024-11-11 22:56:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4055 states to 4055 states and 5139 transitions. [2024-11-11 22:56:06,239 INFO L78 Accepts]: Start accepts. Automaton has 4055 states and 5139 transitions. Word has length 79 [2024-11-11 22:56:06,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:06,239 INFO L471 AbstractCegarLoop]: Abstraction has 4055 states and 5139 transitions. [2024-11-11 22:56:06,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4055 states and 5139 transitions. [2024-11-11 22:56:06,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:06,242 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:06,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:06,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:56:06,242 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:06,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:06,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1348451915, now seen corresponding path program 1 times [2024-11-11 22:56:06,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:06,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014657623] [2024-11-11 22:56:06,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:06,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:06,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:06,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:06,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:06,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:06,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:06,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:06,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014657623] [2024-11-11 22:56:06,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014657623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:06,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:06,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:06,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906804373] [2024-11-11 22:56:06,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:06,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:06,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:06,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:06,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:06,326 INFO L87 Difference]: Start difference. First operand 4055 states and 5139 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:07,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:07,232 INFO L93 Difference]: Finished difference Result 4962 states and 6505 transitions. [2024-11-11 22:56:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:56:07,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:56:07,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:07,243 INFO L225 Difference]: With dead ends: 4962 [2024-11-11 22:56:07,243 INFO L226 Difference]: Without dead ends: 4259 [2024-11-11 22:56:07,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:56:07,246 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 724 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:07,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 640 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:56:07,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2024-11-11 22:56:07,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 4055. [2024-11-11 22:56:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4055 states, 3220 states have (on average 1.2804347826086957) internal successors, (4123), 3265 states have internal predecessors, (4123), 426 states have call successors, (426), 331 states have call predecessors, (426), 407 states have return successors, (585), 468 states have call predecessors, (585), 425 states have call successors, (585) [2024-11-11 22:56:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4055 states to 4055 states and 5134 transitions. [2024-11-11 22:56:07,635 INFO L78 Accepts]: Start accepts. Automaton has 4055 states and 5134 transitions. Word has length 79 [2024-11-11 22:56:07,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:07,635 INFO L471 AbstractCegarLoop]: Abstraction has 4055 states and 5134 transitions. [2024-11-11 22:56:07,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 4055 states and 5134 transitions. [2024-11-11 22:56:07,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:07,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:07,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:07,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 22:56:07,638 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:07,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:07,640 INFO L85 PathProgramCache]: Analyzing trace with hash -984940723, now seen corresponding path program 1 times [2024-11-11 22:56:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:07,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385179255] [2024-11-11 22:56:07,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:07,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:07,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:07,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:07,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:07,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:07,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:07,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:07,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385179255] [2024-11-11 22:56:07,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385179255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:07,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:07,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:07,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107678690] [2024-11-11 22:56:07,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:07,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:07,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:07,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:07,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:07,730 INFO L87 Difference]: Start difference. First operand 4055 states and 5134 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:09,295 INFO L93 Difference]: Finished difference Result 5799 states and 7710 transitions. [2024-11-11 22:56:09,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:56:09,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:56:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:09,311 INFO L225 Difference]: With dead ends: 5799 [2024-11-11 22:56:09,311 INFO L226 Difference]: Without dead ends: 5096 [2024-11-11 22:56:09,315 INFO L434 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-11-11 22:56:09,316 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 824 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:09,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1260 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 22:56:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5096 states. [2024-11-11 22:56:09,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5096 to 4582. [2024-11-11 22:56:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4582 states, 3675 states have (on average 1.3004081632653062) internal successors, (4779), 3724 states have internal predecessors, (4779), 470 states have call successors, (470), 355 states have call predecessors, (470), 435 states have return successors, (651), 516 states have call predecessors, (651), 469 states have call successors, (651) [2024-11-11 22:56:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4582 states to 4582 states and 5900 transitions. [2024-11-11 22:56:09,961 INFO L78 Accepts]: Start accepts. Automaton has 4582 states and 5900 transitions. Word has length 79 [2024-11-11 22:56:09,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:09,961 INFO L471 AbstractCegarLoop]: Abstraction has 4582 states and 5900 transitions. [2024-11-11 22:56:09,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 5900 transitions. [2024-11-11 22:56:09,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:09,965 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:09,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:09,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:56:09,965 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:09,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:09,966 INFO L85 PathProgramCache]: Analyzing trace with hash -783116789, now seen corresponding path program 1 times [2024-11-11 22:56:09,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:09,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117139640] [2024-11-11 22:56:09,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:09,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:10,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:10,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117139640] [2024-11-11 22:56:10,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117139640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:10,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:10,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:10,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905776094] [2024-11-11 22:56:10,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:10,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:10,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:10,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:10,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:10,062 INFO L87 Difference]: Start difference. First operand 4582 states and 5900 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:11,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:11,248 INFO L93 Difference]: Finished difference Result 6121 states and 8187 transitions. [2024-11-11 22:56:11,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:56:11,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:56:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:11,260 INFO L225 Difference]: With dead ends: 6121 [2024-11-11 22:56:11,260 INFO L226 Difference]: Without dead ends: 4891 [2024-11-11 22:56:11,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:56:11,265 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 724 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:11,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 640 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:56:11,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4891 states. [2024-11-11 22:56:11,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4891 to 4582. [2024-11-11 22:56:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4582 states, 3675 states have (on average 1.2979591836734694) internal successors, (4770), 3724 states have internal predecessors, (4770), 470 states have call successors, (470), 355 states have call predecessors, (470), 435 states have return successors, (651), 516 states have call predecessors, (651), 469 states have call successors, (651) [2024-11-11 22:56:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4582 states to 4582 states and 5891 transitions. [2024-11-11 22:56:11,723 INFO L78 Accepts]: Start accepts. Automaton has 4582 states and 5891 transitions. Word has length 79 [2024-11-11 22:56:11,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:11,723 INFO L471 AbstractCegarLoop]: Abstraction has 4582 states and 5891 transitions. [2024-11-11 22:56:11,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 5891 transitions. [2024-11-11 22:56:11,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:11,727 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:11,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:11,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 22:56:11,727 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:11,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:11,728 INFO L85 PathProgramCache]: Analyzing trace with hash -349387703, now seen corresponding path program 1 times [2024-11-11 22:56:11,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:11,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364040711] [2024-11-11 22:56:11,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:11,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:11,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:11,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:11,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:11,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:11,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:11,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:11,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364040711] [2024-11-11 22:56:11,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364040711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:11,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:11,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:11,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451669128] [2024-11-11 22:56:11,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:11,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:11,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:11,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:11,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:11,803 INFO L87 Difference]: Start difference. First operand 4582 states and 5891 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:12,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:12,923 INFO L93 Difference]: Finished difference Result 6127 states and 8188 transitions. [2024-11-11 22:56:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 22:56:12,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:56:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:12,981 INFO L225 Difference]: With dead ends: 6127 [2024-11-11 22:56:12,981 INFO L226 Difference]: Without dead ends: 4898 [2024-11-11 22:56:12,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:56:12,985 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 283 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:12,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1064 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:56:12,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4898 states. [2024-11-11 22:56:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4898 to 4609. [2024-11-11 22:56:13,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4609 states, 3702 states have (on average 1.2957860615883305) internal successors, (4797), 3751 states have internal predecessors, (4797), 470 states have call successors, (470), 355 states have call predecessors, (470), 435 states have return successors, (651), 516 states have call predecessors, (651), 469 states have call successors, (651) [2024-11-11 22:56:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 5918 transitions. [2024-11-11 22:56:13,412 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 5918 transitions. Word has length 79 [2024-11-11 22:56:13,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:13,413 INFO L471 AbstractCegarLoop]: Abstraction has 4609 states and 5918 transitions. [2024-11-11 22:56:13,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 5918 transitions. [2024-11-11 22:56:13,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:13,416 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:13,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:13,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 22:56:13,416 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:13,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:13,416 INFO L85 PathProgramCache]: Analyzing trace with hash -364906421, now seen corresponding path program 1 times [2024-11-11 22:56:13,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:13,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501797579] [2024-11-11 22:56:13,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:13,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:13,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:13,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:13,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:13,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:13,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:13,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501797579] [2024-11-11 22:56:13,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501797579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:13,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:13,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:56:13,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521565448] [2024-11-11 22:56:13,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:13,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:56:13,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:13,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:56:13,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:56:13,505 INFO L87 Difference]: Start difference. First operand 4609 states and 5918 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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-11-11 22:56:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:14,888 INFO L93 Difference]: Finished difference Result 7644 states and 10331 transitions. [2024-11-11 22:56:14,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:56:14,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2024-11-11 22:56:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:14,901 INFO L225 Difference]: With dead ends: 7644 [2024-11-11 22:56:14,902 INFO L226 Difference]: Without dead ends: 6388 [2024-11-11 22:56:14,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-11 22:56:14,905 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 941 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:14,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 982 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:56:14,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6388 states. [2024-11-11 22:56:15,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6388 to 5799. [2024-11-11 22:56:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5799 states, 4734 states have (on average 1.3231939163498099) internal successors, (6264), 4791 states have internal predecessors, (6264), 566 states have call successors, (566), 409 states have call predecessors, (566), 497 states have return successors, (775), 612 states have call predecessors, (775), 565 states have call successors, (775) [2024-11-11 22:56:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5799 states to 5799 states and 7605 transitions. [2024-11-11 22:56:15,434 INFO L78 Accepts]: Start accepts. Automaton has 5799 states and 7605 transitions. Word has length 79 [2024-11-11 22:56:15,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:15,435 INFO L471 AbstractCegarLoop]: Abstraction has 5799 states and 7605 transitions. [2024-11-11 22:56:15,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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-11-11 22:56:15,435 INFO L276 IsEmpty]: Start isEmpty. Operand 5799 states and 7605 transitions. [2024-11-11 22:56:15,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:15,438 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:15,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:15,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 22:56:15,438 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:15,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:15,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2036618700, now seen corresponding path program 1 times [2024-11-11 22:56:15,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:15,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831889890] [2024-11-11 22:56:15,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:15,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:15,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:15,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:15,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:15,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:15,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:15,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:15,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:15,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831889890] [2024-11-11 22:56:15,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831889890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:15,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:15,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:15,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830109119] [2024-11-11 22:56:15,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:15,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:15,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:15,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:15,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:15,515 INFO L87 Difference]: Start difference. First operand 5799 states and 7605 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:16,987 INFO L93 Difference]: Finished difference Result 8868 states and 12086 transitions. [2024-11-11 22:56:16,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 22:56:16,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:56:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:17,008 INFO L225 Difference]: With dead ends: 8868 [2024-11-11 22:56:17,009 INFO L226 Difference]: Without dead ends: 6422 [2024-11-11 22:56:17,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-11 22:56:17,016 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 296 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:17,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1064 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:56:17,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6422 states. [2024-11-11 22:56:17,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6422 to 5826. [2024-11-11 22:56:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5826 states, 4761 states have (on average 1.3194706994328922) internal successors, (6282), 4818 states have internal predecessors, (6282), 566 states have call successors, (566), 409 states have call predecessors, (566), 497 states have return successors, (775), 612 states have call predecessors, (775), 565 states have call successors, (775) [2024-11-11 22:56:17,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 7623 transitions. [2024-11-11 22:56:17,544 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 7623 transitions. Word has length 79 [2024-11-11 22:56:17,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:17,544 INFO L471 AbstractCegarLoop]: Abstraction has 5826 states and 7623 transitions. [2024-11-11 22:56:17,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 7623 transitions. [2024-11-11 22:56:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:17,547 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:17,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:17,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 22:56:17,547 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:17,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:17,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1139225422, now seen corresponding path program 1 times [2024-11-11 22:56:17,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:17,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47434457] [2024-11-11 22:56:17,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:17,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:17,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:17,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47434457] [2024-11-11 22:56:17,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47434457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:17,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:17,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:17,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604725060] [2024-11-11 22:56:17,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:17,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:17,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:17,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:17,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:17,679 INFO L87 Difference]: Start difference. First operand 5826 states and 7623 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:19,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:19,293 INFO L93 Difference]: Finished difference Result 9003 states and 12212 transitions. [2024-11-11 22:56:19,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 22:56:19,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:56:19,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:19,308 INFO L225 Difference]: With dead ends: 9003 [2024-11-11 22:56:19,308 INFO L226 Difference]: Without dead ends: 6530 [2024-11-11 22:56:19,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-11 22:56:19,313 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 306 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:19,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1064 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:56:19,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6530 states. [2024-11-11 22:56:19,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6530 to 5880. [2024-11-11 22:56:19,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5880 states, 4815 states have (on average 1.3158878504672897) internal successors, (6336), 4872 states have internal predecessors, (6336), 566 states have call successors, (566), 409 states have call predecessors, (566), 497 states have return successors, (775), 612 states have call predecessors, (775), 565 states have call successors, (775) [2024-11-11 22:56:19,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5880 states to 5880 states and 7677 transitions. [2024-11-11 22:56:19,824 INFO L78 Accepts]: Start accepts. Automaton has 5880 states and 7677 transitions. Word has length 79 [2024-11-11 22:56:19,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:19,824 INFO L471 AbstractCegarLoop]: Abstraction has 5880 states and 7677 transitions. [2024-11-11 22:56:19,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:19,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5880 states and 7677 transitions. [2024-11-11 22:56:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:19,826 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:19,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:19,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 22:56:19,827 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:19,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:19,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1798756944, now seen corresponding path program 1 times [2024-11-11 22:56:19,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:19,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830963602] [2024-11-11 22:56:19,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:19,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:19,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:19,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:19,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:19,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:19,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:19,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:19,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830963602] [2024-11-11 22:56:19,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830963602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:19,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:19,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:56:19,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059712616] [2024-11-11 22:56:19,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:19,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:56:19,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:19,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:56:19,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:56:19,916 INFO L87 Difference]: Start difference. First operand 5880 states and 7677 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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-11-11 22:56:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:21,516 INFO L93 Difference]: Finished difference Result 12125 states and 16479 transitions. [2024-11-11 22:56:21,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:56:21,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2024-11-11 22:56:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:21,540 INFO L225 Difference]: With dead ends: 12125 [2024-11-11 22:56:21,540 INFO L226 Difference]: Without dead ends: 9598 [2024-11-11 22:56:21,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-11 22:56:21,548 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 1033 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:21,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 982 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:56:21,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9598 states. [2024-11-11 22:56:22,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9598 to 8278. [2024-11-11 22:56:22,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8278 states, 6906 states have (on average 1.3397046046915726) internal successors, (9252), 6979 states have internal predecessors, (9252), 749 states have call successors, (749), 517 states have call predecessors, (749), 621 states have return successors, (1014), 795 states have call predecessors, (1014), 748 states have call successors, (1014) [2024-11-11 22:56:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8278 states to 8278 states and 11015 transitions. [2024-11-11 22:56:22,322 INFO L78 Accepts]: Start accepts. Automaton has 8278 states and 11015 transitions. Word has length 79 [2024-11-11 22:56:22,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:22,322 INFO L471 AbstractCegarLoop]: Abstraction has 8278 states and 11015 transitions. [2024-11-11 22:56:22,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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-11-11 22:56:22,323 INFO L276 IsEmpty]: Start isEmpty. Operand 8278 states and 11015 transitions. [2024-11-11 22:56:22,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:22,325 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:22,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:22,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 22:56:22,325 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:22,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:22,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1444761263, now seen corresponding path program 1 times [2024-11-11 22:56:22,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:22,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941813117] [2024-11-11 22:56:22,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:22,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:22,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:22,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941813117] [2024-11-11 22:56:22,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941813117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:22,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:22,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:22,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476022369] [2024-11-11 22:56:22,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:22,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:22,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:22,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:22,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:22,398 INFO L87 Difference]: Start difference. First operand 8278 states and 11015 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:23,744 INFO L93 Difference]: Finished difference Result 14593 states and 19945 transitions. [2024-11-11 22:56:23,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 22:56:23,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-11 22:56:23,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:23,775 INFO L225 Difference]: With dead ends: 14593 [2024-11-11 22:56:23,775 INFO L226 Difference]: Without dead ends: 9668 [2024-11-11 22:56:23,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-11 22:56:23,785 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 308 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:23,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1059 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:56:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9668 states. [2024-11-11 22:56:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9668 to 8332. [2024-11-11 22:56:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8332 states, 6960 states have (on average 1.3344827586206895) internal successors, (9288), 7033 states have internal predecessors, (9288), 749 states have call successors, (749), 517 states have call predecessors, (749), 621 states have return successors, (1014), 795 states have call predecessors, (1014), 748 states have call successors, (1014) [2024-11-11 22:56:24,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8332 states to 8332 states and 11051 transitions. [2024-11-11 22:56:24,495 INFO L78 Accepts]: Start accepts. Automaton has 8332 states and 11051 transitions. Word has length 79 [2024-11-11 22:56:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:24,496 INFO L471 AbstractCegarLoop]: Abstraction has 8332 states and 11051 transitions. [2024-11-11 22:56:24,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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-11-11 22:56:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 8332 states and 11051 transitions. [2024-11-11 22:56:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:24,498 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:24,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:24,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 22:56:24,498 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:24,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:24,499 INFO L85 PathProgramCache]: Analyzing trace with hash -743161389, now seen corresponding path program 1 times [2024-11-11 22:56:24,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:24,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986270975] [2024-11-11 22:56:24,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:24,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:24,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:24,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:24,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:24,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:24,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:24,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:24,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986270975] [2024-11-11 22:56:24,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986270975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:24,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:24,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:56:24,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450339476] [2024-11-11 22:56:24,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:24,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:56:24,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:24,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:56:24,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:56:24,711 INFO L87 Difference]: Start difference. First operand 8332 states and 11051 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:26,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:26,242 INFO L93 Difference]: Finished difference Result 10624 states and 14232 transitions. [2024-11-11 22:56:26,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 22:56:26,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-11 22:56:26,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:26,256 INFO L225 Difference]: With dead ends: 10624 [2024-11-11 22:56:26,256 INFO L226 Difference]: Without dead ends: 7770 [2024-11-11 22:56:26,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-11 22:56:26,260 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 910 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:26,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 1081 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:56:26,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7770 states. [2024-11-11 22:56:26,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7770 to 6644. [2024-11-11 22:56:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6644 states, 5484 states have (on average 1.312910284463895) internal successors, (7200), 5541 states have internal predecessors, (7200), 625 states have call successors, (625), 445 states have call predecessors, (625), 533 states have return successors, (810), 667 states have call predecessors, (810), 624 states have call successors, (810) [2024-11-11 22:56:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6644 states to 6644 states and 8635 transitions. [2024-11-11 22:56:26,857 INFO L78 Accepts]: Start accepts. Automaton has 6644 states and 8635 transitions. Word has length 79 [2024-11-11 22:56:26,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:26,858 INFO L471 AbstractCegarLoop]: Abstraction has 6644 states and 8635 transitions. [2024-11-11 22:56:26,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:26,858 INFO L276 IsEmpty]: Start isEmpty. Operand 6644 states and 8635 transitions. [2024-11-11 22:56:26,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:26,860 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:26,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:26,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 22:56:26,860 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:26,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:26,860 INFO L85 PathProgramCache]: Analyzing trace with hash -681121775, now seen corresponding path program 1 times [2024-11-11 22:56:26,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:26,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946606455] [2024-11-11 22:56:26,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:26,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,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-11-11 22:56:26,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:26,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946606455] [2024-11-11 22:56:26,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946606455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:26,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:26,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:56:26,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24338387] [2024-11-11 22:56:26,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:26,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:56:26,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:26,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:56:26,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:56:26,955 INFO L87 Difference]: Start difference. First operand 6644 states and 8635 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:28,461 INFO L93 Difference]: Finished difference Result 8620 states and 11396 transitions. [2024-11-11 22:56:28,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 22:56:28,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-11 22:56:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:28,483 INFO L225 Difference]: With dead ends: 8620 [2024-11-11 22:56:28,483 INFO L226 Difference]: Without dead ends: 6370 [2024-11-11 22:56:28,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-11 22:56:28,488 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 894 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:28,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 1081 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:56:28,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6370 states. [2024-11-11 22:56:28,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6370 to 5560. [2024-11-11 22:56:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5560 states, 4540 states have (on average 1.2995594713656389) internal successors, (5900), 4589 states have internal predecessors, (5900), 541 states have call successors, (541), 397 states have call predecessors, (541), 477 states have return successors, (700), 581 states have call predecessors, (700), 540 states have call successors, (700) [2024-11-11 22:56:28,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5560 states to 5560 states and 7141 transitions. [2024-11-11 22:56:28,994 INFO L78 Accepts]: Start accepts. Automaton has 5560 states and 7141 transitions. Word has length 79 [2024-11-11 22:56:28,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:28,994 INFO L471 AbstractCegarLoop]: Abstraction has 5560 states and 7141 transitions. [2024-11-11 22:56:28,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 5560 states and 7141 transitions. [2024-11-11 22:56:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:28,996 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:28,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:28,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-11 22:56:28,996 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:28,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:28,997 INFO L85 PathProgramCache]: Analyzing trace with hash -540573165, now seen corresponding path program 1 times [2024-11-11 22:56:28,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:28,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935478439] [2024-11-11 22:56:28,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:28,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:29,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:29,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:29,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:29,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:29,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:29,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:29,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935478439] [2024-11-11 22:56:29,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935478439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:29,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:29,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:29,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929807563] [2024-11-11 22:56:29,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:29,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:29,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:29,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:29,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:29,115 INFO L87 Difference]: Start difference. First operand 5560 states and 7141 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:30,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:30,159 INFO L93 Difference]: Finished difference Result 8422 states and 11083 transitions. [2024-11-11 22:56:30,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:56:30,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-11 22:56:30,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:30,172 INFO L225 Difference]: With dead ends: 8422 [2024-11-11 22:56:30,172 INFO L226 Difference]: Without dead ends: 6216 [2024-11-11 22:56:30,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:56:30,176 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 688 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:30,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 777 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:56:30,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6216 states. [2024-11-11 22:56:30,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6216 to 5556. [2024-11-11 22:56:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5556 states, 4536 states have (on average 1.2927689594356262) internal successors, (5864), 4585 states have internal predecessors, (5864), 541 states have call successors, (541), 397 states have call predecessors, (541), 477 states have return successors, (700), 581 states have call predecessors, (700), 540 states have call successors, (700) [2024-11-11 22:56:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 7105 transitions. [2024-11-11 22:56:30,683 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 7105 transitions. Word has length 79 [2024-11-11 22:56:30,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:30,684 INFO L471 AbstractCegarLoop]: Abstraction has 5556 states and 7105 transitions. [2024-11-11 22:56:30,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:30,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 7105 transitions. [2024-11-11 22:56:30,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:30,686 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:30,686 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:30,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-11 22:56:30,686 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:30,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:30,686 INFO L85 PathProgramCache]: Analyzing trace with hash -674586671, now seen corresponding path program 1 times [2024-11-11 22:56:30,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:30,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363868575] [2024-11-11 22:56:30,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:30,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:30,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:30,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:30,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:30,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:30,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:30,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:30,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363868575] [2024-11-11 22:56:30,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363868575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:30,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:30,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:30,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529436146] [2024-11-11 22:56:30,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:30,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:30,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:30,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:30,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:30,802 INFO L87 Difference]: Start difference. First operand 5556 states and 7105 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:32,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:32,101 INFO L93 Difference]: Finished difference Result 9167 states and 12015 transitions. [2024-11-11 22:56:32,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:56:32,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-11 22:56:32,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:32,117 INFO L225 Difference]: With dead ends: 9167 [2024-11-11 22:56:32,118 INFO L226 Difference]: Without dead ends: 6964 [2024-11-11 22:56:32,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-11 22:56:32,129 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 1022 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:32,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 645 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:56:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6964 states. [2024-11-11 22:56:32,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6964 to 5848. [2024-11-11 22:56:32,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5848 states, 4804 states have (on average 1.2805995004163198) internal successors, (6152), 4853 states have internal predecessors, (6152), 549 states have call successors, (549), 413 states have call predecessors, (549), 493 states have return successors, (724), 589 states have call predecessors, (724), 548 states have call successors, (724) [2024-11-11 22:56:32,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5848 states to 5848 states and 7425 transitions. [2024-11-11 22:56:32,715 INFO L78 Accepts]: Start accepts. Automaton has 5848 states and 7425 transitions. Word has length 79 [2024-11-11 22:56:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:32,716 INFO L471 AbstractCegarLoop]: Abstraction has 5848 states and 7425 transitions. [2024-11-11 22:56:32,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 5848 states and 7425 transitions. [2024-11-11 22:56:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:32,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:32,719 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:32,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-11 22:56:32,719 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:32,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1814942291, now seen corresponding path program 1 times [2024-11-11 22:56:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:32,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954404670] [2024-11-11 22:56:32,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:32,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:32,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:32,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:32,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:32,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:32,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:32,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:32,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954404670] [2024-11-11 22:56:32,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954404670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:32,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:32,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:56:32,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105287306] [2024-11-11 22:56:32,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:32,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:56:32,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:32,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:56:32,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:56:32,828 INFO L87 Difference]: Start difference. First operand 5848 states and 7425 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:34,332 INFO L93 Difference]: Finished difference Result 8750 states and 11301 transitions. [2024-11-11 22:56:34,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 22:56:34,333 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-11 22:56:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:34,352 INFO L225 Difference]: With dead ends: 8750 [2024-11-11 22:56:34,352 INFO L226 Difference]: Without dead ends: 6822 [2024-11-11 22:56:34,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-11 22:56:34,357 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 914 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:34,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 1065 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:56:34,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6822 states. [2024-11-11 22:56:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6822 to 5832. [2024-11-11 22:56:34,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5832 states, 4792 states have (on average 1.2787979966611018) internal successors, (6128), 4837 states have internal predecessors, (6128), 549 states have call successors, (549), 413 states have call predecessors, (549), 489 states have return successors, (715), 588 states have call predecessors, (715), 548 states have call successors, (715) [2024-11-11 22:56:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5832 states to 5832 states and 7392 transitions. [2024-11-11 22:56:34,945 INFO L78 Accepts]: Start accepts. Automaton has 5832 states and 7392 transitions. Word has length 79 [2024-11-11 22:56:34,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:34,946 INFO L471 AbstractCegarLoop]: Abstraction has 5832 states and 7392 transitions. [2024-11-11 22:56:34,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 5832 states and 7392 transitions. [2024-11-11 22:56:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:34,948 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:34,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:34,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-11 22:56:34,948 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:34,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:34,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2033797009, now seen corresponding path program 1 times [2024-11-11 22:56:34,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:34,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135919187] [2024-11-11 22:56:34,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:34,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:34,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:34,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:35,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:35,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:35,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:35,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:35,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135919187] [2024-11-11 22:56:35,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135919187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:35,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:35,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:35,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580368232] [2024-11-11 22:56:35,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:35,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:35,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:35,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:35,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:35,023 INFO L87 Difference]: Start difference. First operand 5832 states and 7392 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:36,442 INFO L93 Difference]: Finished difference Result 9876 states and 12684 transitions. [2024-11-11 22:56:36,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:56:36,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-11 22:56:36,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:36,461 INFO L225 Difference]: With dead ends: 9876 [2024-11-11 22:56:36,462 INFO L226 Difference]: Without dead ends: 7398 [2024-11-11 22:56:36,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-11 22:56:36,468 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 767 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:36,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 775 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:56:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7398 states. [2024-11-11 22:56:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7398 to 6388. [2024-11-11 22:56:37,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6388 states, 5303 states have (on average 1.2617386385065057) internal successors, (6691), 5348 states have internal predecessors, (6691), 563 states have call successors, (563), 443 states have call predecessors, (563), 520 states have return successors, (745), 603 states have call predecessors, (745), 562 states have call successors, (745) [2024-11-11 22:56:37,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6388 states to 6388 states and 7999 transitions. [2024-11-11 22:56:37,143 INFO L78 Accepts]: Start accepts. Automaton has 6388 states and 7999 transitions. Word has length 79 [2024-11-11 22:56:37,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:37,143 INFO L471 AbstractCegarLoop]: Abstraction has 6388 states and 7999 transitions. [2024-11-11 22:56:37,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 6388 states and 7999 transitions. [2024-11-11 22:56:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:56:37,145 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:37,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:37,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-11 22:56:37,145 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:37,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:37,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1216148559, now seen corresponding path program 1 times [2024-11-11 22:56:37,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:37,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253876049] [2024-11-11 22:56:37,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:37,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:37,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:37,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253876049] [2024-11-11 22:56:37,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253876049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:37,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:37,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:56:37,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105852749] [2024-11-11 22:56:37,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:37,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:56:37,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:37,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:56:37,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:56:37,190 INFO L87 Difference]: Start difference. First operand 6388 states and 7999 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 22:56:38,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:38,566 INFO L93 Difference]: Finished difference Result 12535 states and 15946 transitions. [2024-11-11 22:56:38,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:56:38,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 79 [2024-11-11 22:56:38,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:38,590 INFO L225 Difference]: With dead ends: 12535 [2024-11-11 22:56:38,591 INFO L226 Difference]: Without dead ends: 9500 [2024-11-11 22:56:38,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:56:38,600 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 811 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:38,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 579 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:56:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9500 states. [2024-11-11 22:56:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9500 to 8056. [2024-11-11 22:56:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8056 states, 6776 states have (on average 1.2626918536009446) internal successors, (8556), 6837 states have internal predecessors, (8556), 675 states have call successors, (675), 523 states have call predecessors, (675), 603 states have return successors, (864), 702 states have call predecessors, (864), 674 states have call successors, (864) [2024-11-11 22:56:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8056 states to 8056 states and 10095 transitions. [2024-11-11 22:56:39,423 INFO L78 Accepts]: Start accepts. Automaton has 8056 states and 10095 transitions. Word has length 79 [2024-11-11 22:56:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:39,424 INFO L471 AbstractCegarLoop]: Abstraction has 8056 states and 10095 transitions. [2024-11-11 22:56:39,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 22:56:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 8056 states and 10095 transitions. [2024-11-11 22:56:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-11 22:56:39,426 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:39,427 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:39,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-11 22:56:39,427 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:39,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:39,427 INFO L85 PathProgramCache]: Analyzing trace with hash -484741378, now seen corresponding path program 1 times [2024-11-11 22:56:39,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:39,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42011741] [2024-11-11 22:56:39,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:39,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:39,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:39,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:39,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:39,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:39,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:39,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:39,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:39,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 22:56:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 22:56:39,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:39,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42011741] [2024-11-11 22:56:39,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42011741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:39,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:39,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:56:39,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477300506] [2024-11-11 22:56:39,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:39,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:56:39,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:39,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:56:39,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:56:39,497 INFO L87 Difference]: Start difference. First operand 8056 states and 10095 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 22:56:41,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:41,500 INFO L93 Difference]: Finished difference Result 14928 states and 18512 transitions. [2024-11-11 22:56:41,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-11 22:56:41,500 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2024-11-11 22:56:41,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:41,525 INFO L225 Difference]: With dead ends: 14928 [2024-11-11 22:56:41,525 INFO L226 Difference]: Without dead ends: 10291 [2024-11-11 22:56:41,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-11 22:56:41,536 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 882 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:41,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 1145 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:56:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10291 states. [2024-11-11 22:56:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10291 to 9971. [2024-11-11 22:56:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9971 states, 8234 states have (on average 1.2483604566431867) internal successors, (10279), 8338 states have internal predecessors, (10279), 879 states have call successors, (879), 697 states have call predecessors, (879), 856 states have return successors, (1246), 942 states have call predecessors, (1246), 878 states have call successors, (1246) [2024-11-11 22:56:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9971 states to 9971 states and 12404 transitions. [2024-11-11 22:56:42,638 INFO L78 Accepts]: Start accepts. Automaton has 9971 states and 12404 transitions. Word has length 84 [2024-11-11 22:56:42,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:42,638 INFO L471 AbstractCegarLoop]: Abstraction has 9971 states and 12404 transitions. [2024-11-11 22:56:42,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 22:56:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 9971 states and 12404 transitions. [2024-11-11 22:56:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 22:56:42,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:42,641 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:42,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-11 22:56:42,642 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:42,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:42,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1046063412, now seen corresponding path program 1 times [2024-11-11 22:56:42,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:42,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487956690] [2024-11-11 22:56:42,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:42,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:42,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:42,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:42,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:42,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:42,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:42,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:42,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:42,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 22:56:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 22:56:42,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:42,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487956690] [2024-11-11 22:56:42,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487956690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:42,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:42,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:56:42,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093567892] [2024-11-11 22:56:42,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:42,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:56:42,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:42,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:56:42,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:56:42,722 INFO L87 Difference]: Start difference. First operand 9971 states and 12404 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 22:56:44,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:44,617 INFO L93 Difference]: Finished difference Result 13974 states and 17244 transitions. [2024-11-11 22:56:44,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 22:56:44,617 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2024-11-11 22:56:44,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:44,644 INFO L225 Difference]: With dead ends: 13974 [2024-11-11 22:56:44,644 INFO L226 Difference]: Without dead ends: 9381 [2024-11-11 22:56:44,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-11-11 22:56:44,654 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 1271 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:44,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 1372 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:56:44,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9381 states. [2024-11-11 22:56:45,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9381 to 9047. [2024-11-11 22:56:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9047 states, 7523 states have (on average 1.2465771633656786) internal successors, (9378), 7609 states have internal predecessors, (9378), 780 states have call successors, (780), 612 states have call predecessors, (780), 742 states have return successors, (1024), 832 states have call predecessors, (1024), 779 states have call successors, (1024) [2024-11-11 22:56:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9047 states to 9047 states and 11182 transitions. [2024-11-11 22:56:45,668 INFO L78 Accepts]: Start accepts. Automaton has 9047 states and 11182 transitions. Word has length 93 [2024-11-11 22:56:45,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:45,668 INFO L471 AbstractCegarLoop]: Abstraction has 9047 states and 11182 transitions. [2024-11-11 22:56:45,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 22:56:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 9047 states and 11182 transitions. [2024-11-11 22:56:45,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-11 22:56:45,673 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:45,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:45,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-11 22:56:45,674 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:45,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:45,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1180889490, now seen corresponding path program 1 times [2024-11-11 22:56:45,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:45,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467991739] [2024-11-11 22:56:45,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:45,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:45,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:45,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:45,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:45,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:45,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:45,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:56:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:45,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:56:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:45,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 22:56:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-11 22:56:45,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:45,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467991739] [2024-11-11 22:56:45,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467991739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:45,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:45,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:45,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687090140] [2024-11-11 22:56:45,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:45,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:45,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:45,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:45,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:45,878 INFO L87 Difference]: Start difference. First operand 9047 states and 11182 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 5 states have internal predecessors, (84), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-11 22:56:48,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:48,132 INFO L93 Difference]: Finished difference Result 21236 states and 26683 transitions. [2024-11-11 22:56:48,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:56:48,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 5 states have internal predecessors, (84), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 129 [2024-11-11 22:56:48,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:48,174 INFO L225 Difference]: With dead ends: 21236 [2024-11-11 22:56:48,175 INFO L226 Difference]: Without dead ends: 16534 [2024-11-11 22:56:48,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-11 22:56:48,187 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 1181 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:48,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1199 Valid, 777 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:56:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16534 states. [2024-11-11 22:56:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16534 to 14218. [2024-11-11 22:56:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14218 states, 12104 states have (on average 1.2475214805023134) internal successors, (15100), 12243 states have internal predecessors, (15100), 1079 states have call successors, (1079), 832 states have call predecessors, (1079), 1033 states have return successors, (1544), 1150 states have call predecessors, (1544), 1078 states have call successors, (1544) [2024-11-11 22:56:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14218 states to 14218 states and 17723 transitions. [2024-11-11 22:56:49,642 INFO L78 Accepts]: Start accepts. Automaton has 14218 states and 17723 transitions. Word has length 129 [2024-11-11 22:56:49,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:49,643 INFO L471 AbstractCegarLoop]: Abstraction has 14218 states and 17723 transitions. [2024-11-11 22:56:49,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 5 states have internal predecessors, (84), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-11 22:56:49,643 INFO L276 IsEmpty]: Start isEmpty. Operand 14218 states and 17723 transitions. [2024-11-11 22:56:49,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-11 22:56:49,649 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:49,649 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:49,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-11 22:56:49,649 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:49,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:49,650 INFO L85 PathProgramCache]: Analyzing trace with hash 88254288, now seen corresponding path program 1 times [2024-11-11 22:56:49,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:49,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368629986] [2024-11-11 22:56:49,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:49,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:49,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:49,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:49,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:49,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:49,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:49,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:56:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:49,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:56:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:49,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 22:56:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 22:56:49,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:49,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368629986] [2024-11-11 22:56:49,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368629986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:49,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:49,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:56:49,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146700059] [2024-11-11 22:56:49,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:49,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:56:49,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:49,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:56:49,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:56:49,698 INFO L87 Difference]: Start difference. First operand 14218 states and 17723 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:52,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:52,087 INFO L93 Difference]: Finished difference Result 23887 states and 29940 transitions. [2024-11-11 22:56:52,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:56:52,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 129 [2024-11-11 22:56:52,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:52,122 INFO L225 Difference]: With dead ends: 23887 [2024-11-11 22:56:52,123 INFO L226 Difference]: Without dead ends: 14014 [2024-11-11 22:56:52,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:56:52,135 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 557 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:52,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 542 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:56:52,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14014 states. [2024-11-11 22:56:53,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14014 to 12013. [2024-11-11 22:56:53,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12013 states, 10164 states have (on average 1.2446871310507674) internal successors, (12651), 10292 states have internal predecessors, (12651), 928 states have call successors, (928), 722 states have call predecessors, (928), 919 states have return successors, (1336), 1005 states have call predecessors, (1336), 927 states have call successors, (1336) [2024-11-11 22:56:53,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12013 states to 12013 states and 14915 transitions. [2024-11-11 22:56:53,429 INFO L78 Accepts]: Start accepts. Automaton has 12013 states and 14915 transitions. Word has length 129 [2024-11-11 22:56:53,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:53,429 INFO L471 AbstractCegarLoop]: Abstraction has 12013 states and 14915 transitions. [2024-11-11 22:56:53,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:53,430 INFO L276 IsEmpty]: Start isEmpty. Operand 12013 states and 14915 transitions. [2024-11-11 22:56:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 22:56:53,435 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:53,435 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:53,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-11 22:56:53,436 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:53,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:53,436 INFO L85 PathProgramCache]: Analyzing trace with hash -489510537, now seen corresponding path program 1 times [2024-11-11 22:56:53,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:53,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458248169] [2024-11-11 22:56:53,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:53,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:53,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:53,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:53,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:53,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:53,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:53,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:56:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:53,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:56:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:53,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 22:56:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:53,588 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-11 22:56:53,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:53,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458248169] [2024-11-11 22:56:53,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458248169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:53,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:53,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:53,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510696838] [2024-11-11 22:56:53,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:53,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:53,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:53,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:53,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:53,590 INFO L87 Difference]: Start difference. First operand 12013 states and 14915 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-11 22:56:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:56,516 INFO L93 Difference]: Finished difference Result 29408 states and 36956 transitions. [2024-11-11 22:56:56,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:56:56,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 131 [2024-11-11 22:56:56,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:56,573 INFO L225 Difference]: With dead ends: 29408 [2024-11-11 22:56:56,573 INFO L226 Difference]: Without dead ends: 21740 [2024-11-11 22:56:56,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-11 22:56:56,592 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 778 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:56,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1010 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:56:56,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21740 states. [2024-11-11 22:56:59,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21740 to 18622. [2024-11-11 22:56:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18622 states, 15919 states have (on average 1.245178717256109) internal successors, (19822), 16178 states have internal predecessors, (19822), 1317 states have call successors, (1317), 982 states have call predecessors, (1317), 1384 states have return successors, (2203), 1469 states have call predecessors, (2203), 1316 states have call successors, (2203) [2024-11-11 22:56:59,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18622 states to 18622 states and 23342 transitions. [2024-11-11 22:56:59,153 INFO L78 Accepts]: Start accepts. Automaton has 18622 states and 23342 transitions. Word has length 131 [2024-11-11 22:56:59,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:59,154 INFO L471 AbstractCegarLoop]: Abstraction has 18622 states and 23342 transitions. [2024-11-11 22:56:59,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-11 22:56:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 18622 states and 23342 transitions. [2024-11-11 22:56:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 22:56:59,162 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:59,162 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:59,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-11 22:56:59,162 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:59,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:59,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1463431, now seen corresponding path program 1 times [2024-11-11 22:56:59,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:59,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673352128] [2024-11-11 22:56:59,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:59,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:59,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:59,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:56:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:59,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:56:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:59,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:59,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:56:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:59,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:56:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:59,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:56:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:59,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 22:56:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 22:56:59,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:59,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673352128] [2024-11-11 22:56:59,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673352128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:59,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:59,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:56:59,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860481167] [2024-11-11 22:56:59,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:59,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:56:59,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:59,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:56:59,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:56:59,214 INFO L87 Difference]: Start difference. First operand 18622 states and 23342 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:57:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:57:01,916 INFO L93 Difference]: Finished difference Result 35955 states and 45293 transitions. [2024-11-11 22:57:01,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:57:01,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 131 [2024-11-11 22:57:01,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:57:01,969 INFO L225 Difference]: With dead ends: 35955 [2024-11-11 22:57:01,969 INFO L226 Difference]: Without dead ends: 21677 [2024-11-11 22:57:01,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:57:01,987 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 555 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:57:01,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 538 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:57:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21677 states. [2024-11-11 22:57:03,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21677 to 18617. [2024-11-11 22:57:03,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18617 states, 15917 states have (on average 1.2450838725890556) internal successors, (19818), 16175 states have internal predecessors, (19818), 1314 states have call successors, (1314), 982 states have call predecessors, (1314), 1384 states have return successors, (2199), 1466 states have call predecessors, (2199), 1313 states have call successors, (2199) [2024-11-11 22:57:04,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 23331 transitions. [2024-11-11 22:57:04,031 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 23331 transitions. Word has length 131 [2024-11-11 22:57:04,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:04,031 INFO L471 AbstractCegarLoop]: Abstraction has 18617 states and 23331 transitions. [2024-11-11 22:57:04,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:57:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 23331 transitions. [2024-11-11 22:57:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-11 22:57:04,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:04,039 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:57:04,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-11 22:57:04,039 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:04,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:04,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1288163950, now seen corresponding path program 1 times [2024-11-11 22:57:04,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:04,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464309258] [2024-11-11 22:57:04,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:04,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:04,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:04,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:57:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:04,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:57:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:04,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:57:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:04,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:57:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:04,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:57:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:04,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-11 22:57:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:04,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 22:57:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-11 22:57:04,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:04,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464309258] [2024-11-11 22:57:04,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464309258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:04,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:04,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:57:04,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574300487] [2024-11-11 22:57:04,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:04,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:57:04,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:04,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:57:04,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:57:04,152 INFO L87 Difference]: Start difference. First operand 18617 states and 23331 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-11 22:57:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:57:08,811 INFO L93 Difference]: Finished difference Result 50279 states and 63582 transitions. [2024-11-11 22:57:08,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:57:08,811 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 133 [2024-11-11 22:57:08,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:57:08,902 INFO L225 Difference]: With dead ends: 50279 [2024-11-11 22:57:08,902 INFO L226 Difference]: Without dead ends: 36007 [2024-11-11 22:57:08,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-11 22:57:08,925 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 792 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:57:08,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 938 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:57:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36007 states. [2024-11-11 22:57:12,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36007 to 30611. [2024-11-11 22:57:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30611 states, 26360 states have (on average 1.2479135053110775) internal successors, (32895), 26799 states have internal predecessors, (32895), 2089 states have call successors, (2089), 1502 states have call predecessors, (2089), 2160 states have return successors, (3598), 2317 states have call predecessors, (3598), 2088 states have call successors, (3598) [2024-11-11 22:57:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30611 states to 30611 states and 38582 transitions. [2024-11-11 22:57:12,234 INFO L78 Accepts]: Start accepts. Automaton has 30611 states and 38582 transitions. Word has length 133 [2024-11-11 22:57:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:12,234 INFO L471 AbstractCegarLoop]: Abstraction has 30611 states and 38582 transitions. [2024-11-11 22:57:12,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-11 22:57:12,235 INFO L276 IsEmpty]: Start isEmpty. Operand 30611 states and 38582 transitions. [2024-11-11 22:57:12,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-11 22:57:12,245 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:12,246 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:57:12,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-11 22:57:12,246 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:12,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:12,247 INFO L85 PathProgramCache]: Analyzing trace with hash 956394448, now seen corresponding path program 1 times [2024-11-11 22:57:12,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:12,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383964463] [2024-11-11 22:57:12,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:12,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:12,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:12,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 22:57:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:12,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:57:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:12,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:57:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:12,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 22:57:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:12,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:57:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat