./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ecd70163e84c8e1a236d7543bf55ca7587f7becacb8c522f7caae4b1076f13b5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 00:09:13,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 00:09:13,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 00:09:13,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 00:09:13,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 00:09:13,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 00:09:13,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 00:09:13,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 00:09:13,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 00:09:13,230 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 00:09:13,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 00:09:13,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 00:09:13,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 00:09:13,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 00:09:13,235 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 00:09:13,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 00:09:13,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 00:09:13,236 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 00:09:13,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 00:09:13,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 00:09:13,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 00:09:13,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 00:09:13,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 00:09:13,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 00:09:13,242 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 00:09:13,243 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 00:09:13,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 00:09:13,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 00:09:13,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 00:09:13,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 00:09:13,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 00:09:13,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 00:09:13,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:09:13,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 00:09:13,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 00:09:13,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 00:09:13,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 00:09:13,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 00:09:13,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 00:09:13,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 00:09:13,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 00:09:13,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 00:09:13,247 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 -> ecd70163e84c8e1a236d7543bf55ca7587f7becacb8c522f7caae4b1076f13b5 [2024-11-20 00:09:13,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 00:09:13,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 00:09:13,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 00:09:13,516 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 00:09:13,516 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 00:09:13,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-1.c [2024-11-20 00:09:14,940 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 00:09:15,176 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 00:09:15,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-1.c [2024-11-20 00:09:15,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d04749149/337b8b6911bb4fd2a5a86e6742e70bce/FLAG7a726a64c [2024-11-20 00:09:15,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d04749149/337b8b6911bb4fd2a5a86e6742e70bce [2024-11-20 00:09:15,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 00:09:15,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 00:09:15,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 00:09:15,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 00:09:15,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 00:09:15,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:09:15" (1/1) ... [2024-11-20 00:09:15,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a328382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:15, skipping insertion in model container [2024-11-20 00:09:15,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:09:15" (1/1) ... [2024-11-20 00:09:15,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 00:09:15,758 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.11.cil-1.c[914,927] [2024-11-20 00:09:15,860 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.11.cil-1.c[7115,7128] [2024-11-20 00:09:16,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:09:16,031 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 00:09:16,043 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.11.cil-1.c[914,927] [2024-11-20 00:09:16,070 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.11.cil-1.c[7115,7128] [2024-11-20 00:09:16,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:09:16,149 INFO L204 MainTranslator]: Completed translation [2024-11-20 00:09:16,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:16 WrapperNode [2024-11-20 00:09:16,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 00:09:16,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 00:09:16,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 00:09:16,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 00:09:16,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:16" (1/1) ... [2024-11-20 00:09:16,171 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:16" (1/1) ... [2024-11-20 00:09:16,224 INFO L138 Inliner]: procedures = 75, calls = 91, calls flagged for inlining = 43, calls inlined = 43, statements flattened = 1014 [2024-11-20 00:09:16,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 00:09:16,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 00:09:16,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 00:09:16,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 00:09:16,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:16" (1/1) ... [2024-11-20 00:09:16,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:16" (1/1) ... [2024-11-20 00:09:16,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:16" (1/1) ... [2024-11-20 00:09:16,288 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-20 00:09:16,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:16" (1/1) ... [2024-11-20 00:09:16,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:16" (1/1) ... [2024-11-20 00:09:16,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:16" (1/1) ... [2024-11-20 00:09:16,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:16" (1/1) ... [2024-11-20 00:09:16,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:16" (1/1) ... [2024-11-20 00:09:16,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:16" (1/1) ... [2024-11-20 00:09:16,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 00:09:16,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 00:09:16,335 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 00:09:16,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 00:09:16,336 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:16" (1/1) ... [2024-11-20 00:09:16,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:09:16,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:09:16,386 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-20 00:09:16,388 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-20 00:09:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 00:09:16,434 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-20 00:09:16,434 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-20 00:09:16,434 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-20 00:09:16,435 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-20 00:09:16,435 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-20 00:09:16,436 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-20 00:09:16,436 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-20 00:09:16,436 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-20 00:09:16,436 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-20 00:09:16,436 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-20 00:09:16,437 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-20 00:09:16,437 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-20 00:09:16,437 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-20 00:09:16,437 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-20 00:09:16,437 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-20 00:09:16,437 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-20 00:09:16,437 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-20 00:09:16,437 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-20 00:09:16,438 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-20 00:09:16,438 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-20 00:09:16,438 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-20 00:09:16,438 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-20 00:09:16,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 00:09:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-20 00:09:16,439 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-20 00:09:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-20 00:09:16,439 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-20 00:09:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 00:09:16,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 00:09:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-20 00:09:16,440 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-20 00:09:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-20 00:09:16,440 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-20 00:09:16,582 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 00:09:16,583 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 00:09:17,548 INFO L? ?]: Removed 125 outVars from TransFormulas that were not future-live. [2024-11-20 00:09:17,549 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 00:09:17,578 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 00:09:17,580 INFO L316 CfgBuilder]: Removed 18 assume(true) statements. [2024-11-20 00:09:17,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:09:17 BoogieIcfgContainer [2024-11-20 00:09:17,581 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 00:09:17,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 00:09:17,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 00:09:17,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 00:09:17,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:09:15" (1/3) ... [2024-11-20 00:09:17,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a893979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:09:17, skipping insertion in model container [2024-11-20 00:09:17,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:16" (2/3) ... [2024-11-20 00:09:17,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a893979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:09:17, skipping insertion in model container [2024-11-20 00:09:17,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:09:17" (3/3) ... [2024-11-20 00:09:17,592 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.11.cil-1.c [2024-11-20 00:09:17,604 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 00:09:17,605 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 00:09:17,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 00:09:17,692 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;@16fd7a77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 00:09:17,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 00:09:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 478 states, 419 states have (on average 1.6229116945107398) internal successors, (680), 427 states have internal predecessors, (680), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-20 00:09:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:09:17,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:17,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:17,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:17,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:17,720 INFO L85 PathProgramCache]: Analyzing trace with hash 754891210, now seen corresponding path program 1 times [2024-11-20 00:09:17,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:17,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436857458] [2024-11-20 00:09:17,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:17,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:18,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:18,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:18,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:18,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:18,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:18,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:18,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:09:18,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:18,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436857458] [2024-11-20 00:09:18,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436857458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:18,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:18,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:09:18,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93744202] [2024-11-20 00:09:18,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:18,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:09:18,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:18,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:09:18,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:09:18,362 INFO L87 Difference]: Start difference. First operand has 478 states, 419 states have (on average 1.6229116945107398) internal successors, (680), 427 states have internal predecessors, (680), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) 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-20 00:09:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:19,909 INFO L93 Difference]: Finished difference Result 1063 states and 1684 transitions. [2024-11-20 00:09:19,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:09:19,913 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-20 00:09:19,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:19,935 INFO L225 Difference]: With dead ends: 1063 [2024-11-20 00:09:19,936 INFO L226 Difference]: Without dead ends: 602 [2024-11-20 00:09:19,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:09:19,952 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 822 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:19,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 2548 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:09:19,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-20 00:09:20,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 563. [2024-11-20 00:09:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 487 states have (on average 1.513347022587269) internal successors, (737), 494 states have internal predecessors, (737), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2024-11-20 00:09:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 842 transitions. [2024-11-20 00:09:20,079 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 842 transitions. Word has length 65 [2024-11-20 00:09:20,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:20,080 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 842 transitions. [2024-11-20 00:09:20,080 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-20 00:09:20,081 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 842 transitions. [2024-11-20 00:09:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:09:20,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:20,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:09:20,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 00:09:20,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:20,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:20,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2001736056, now seen corresponding path program 1 times [2024-11-20 00:09:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:20,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460531310] [2024-11-20 00:09:20,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:20,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:20,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:20,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:20,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:20,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:20,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:20,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:20,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:20,346 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-20 00:09:20,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:20,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460531310] [2024-11-20 00:09:20,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460531310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:20,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:20,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:09:20,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892911784] [2024-11-20 00:09:20,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:20,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:09:20,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:20,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:09:20,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:09:20,350 INFO L87 Difference]: Start difference. First operand 563 states and 842 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-20 00:09:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:21,739 INFO L93 Difference]: Finished difference Result 910 states and 1319 transitions. [2024-11-20 00:09:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 00:09:21,740 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-20 00:09:21,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:21,747 INFO L225 Difference]: With dead ends: 910 [2024-11-20 00:09:21,747 INFO L226 Difference]: Without dead ends: 733 [2024-11-20 00:09:21,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-20 00:09:21,752 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 1369 mSDsluCounter, 1922 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:21,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 2362 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:09:21,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-11-20 00:09:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 659. [2024-11-20 00:09:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 563 states have (on average 1.4937833037300177) internal successors, (841), 572 states have internal predecessors, (841), 63 states have call successors, (63), 29 states have call predecessors, (63), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2024-11-20 00:09:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 976 transitions. [2024-11-20 00:09:21,815 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 976 transitions. Word has length 65 [2024-11-20 00:09:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:21,815 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 976 transitions. [2024-11-20 00:09:21,816 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-20 00:09:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 976 transitions. [2024-11-20 00:09:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:09:21,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:21,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:21,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 00:09:21,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:21,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:21,820 INFO L85 PathProgramCache]: Analyzing trace with hash 264645130, now seen corresponding path program 1 times [2024-11-20 00:09:21,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:21,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770882597] [2024-11-20 00:09:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:21,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:21,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:21,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:21,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:21,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:21,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:21,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:22,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:22,004 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-20 00:09:22,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:22,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770882597] [2024-11-20 00:09:22,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770882597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:22,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:22,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:09:22,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599255878] [2024-11-20 00:09:22,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:22,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:09:22,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:22,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:09:22,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:09:22,009 INFO L87 Difference]: Start difference. First operand 659 states and 976 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-20 00:09:23,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:23,316 INFO L93 Difference]: Finished difference Result 958 states and 1387 transitions. [2024-11-20 00:09:23,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:09:23,317 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-20 00:09:23,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:23,322 INFO L225 Difference]: With dead ends: 958 [2024-11-20 00:09:23,322 INFO L226 Difference]: Without dead ends: 691 [2024-11-20 00:09:23,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-20 00:09:23,324 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 909 mSDsluCounter, 2129 mSDsCounter, 0 mSdLazyCounter, 1838 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 2538 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:23,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 2538 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1838 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:09:23,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-11-20 00:09:23,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 664. [2024-11-20 00:09:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 567 states have (on average 1.4867724867724867) internal successors, (843), 576 states have internal predecessors, (843), 63 states have call successors, (63), 29 states have call predecessors, (63), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2024-11-20 00:09:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 979 transitions. [2024-11-20 00:09:23,366 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 979 transitions. Word has length 65 [2024-11-20 00:09:23,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:23,367 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 979 transitions. [2024-11-20 00:09:23,367 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-20 00:09:23,368 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 979 transitions. [2024-11-20 00:09:23,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:09:23,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:23,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:23,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 00:09:23,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:23,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:23,371 INFO L85 PathProgramCache]: Analyzing trace with hash -764714168, now seen corresponding path program 1 times [2024-11-20 00:09:23,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:23,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035498358] [2024-11-20 00:09:23,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:23,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:23,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:23,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:23,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:23,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:23,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:23,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:23,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:09:23,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:23,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035498358] [2024-11-20 00:09:23,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035498358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:23,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:23,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:09:23,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754731675] [2024-11-20 00:09:23,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:23,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:09:23,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:23,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:09:23,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:09:23,531 INFO L87 Difference]: Start difference. First operand 664 states and 979 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:09:25,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:25,572 INFO L93 Difference]: Finished difference Result 2326 states and 3251 transitions. [2024-11-20 00:09:25,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-20 00:09:25,572 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-20 00:09:25,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:25,582 INFO L225 Difference]: With dead ends: 2326 [2024-11-20 00:09:25,582 INFO L226 Difference]: Without dead ends: 2054 [2024-11-20 00:09:25,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-20 00:09:25,587 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 2599 mSDsluCounter, 2034 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2613 SdHoareTripleChecker+Valid, 2565 SdHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:25,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2613 Valid, 2565 Invalid, 2350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 00:09:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2024-11-20 00:09:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1804. [2024-11-20 00:09:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1467 states have (on average 1.3796864349011588) internal successors, (2024), 1496 states have internal predecessors, (2024), 180 states have call successors, (180), 131 states have call predecessors, (180), 155 states have return successors, (259), 180 states have call predecessors, (259), 176 states have call successors, (259) [2024-11-20 00:09:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2463 transitions. [2024-11-20 00:09:25,744 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2463 transitions. Word has length 65 [2024-11-20 00:09:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:25,747 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2463 transitions. [2024-11-20 00:09:25,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:09:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2463 transitions. [2024-11-20 00:09:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:09:25,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:25,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:09:25,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 00:09:25,749 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:25,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:25,750 INFO L85 PathProgramCache]: Analyzing trace with hash 286734921, now seen corresponding path program 1 times [2024-11-20 00:09:25,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:25,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375863519] [2024-11-20 00:09:25,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:25,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:25,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:25,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:25,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:25,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:25,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:25,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:25,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:25,893 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-20 00:09:25,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:25,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375863519] [2024-11-20 00:09:25,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375863519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:25,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:25,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:09:25,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515408769] [2024-11-20 00:09:25,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:25,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:09:25,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:25,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:09:25,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:09:25,895 INFO L87 Difference]: Start difference. First operand 1804 states and 2463 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-20 00:09:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:27,192 INFO L93 Difference]: Finished difference Result 3401 states and 4582 transitions. [2024-11-20 00:09:27,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 00:09:27,192 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-20 00:09:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:27,203 INFO L225 Difference]: With dead ends: 3401 [2024-11-20 00:09:27,203 INFO L226 Difference]: Without dead ends: 1989 [2024-11-20 00:09:27,206 INFO L431 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-20 00:09:27,208 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 611 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 1888 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 2865 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:27,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 2865 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1888 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 00:09:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2024-11-20 00:09:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1849. [2024-11-20 00:09:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1503 states have (on average 1.364604125083167) internal successors, (2051), 1532 states have internal predecessors, (2051), 180 states have call successors, (180), 131 states have call predecessors, (180), 164 states have return successors, (271), 189 states have call predecessors, (271), 176 states have call successors, (271) [2024-11-20 00:09:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2502 transitions. [2024-11-20 00:09:27,350 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2502 transitions. Word has length 65 [2024-11-20 00:09:27,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:27,350 INFO L471 AbstractCegarLoop]: Abstraction has 1849 states and 2502 transitions. [2024-11-20 00:09:27,350 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-20 00:09:27,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2502 transitions. [2024-11-20 00:09:27,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:09:27,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:27,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:27,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 00:09:27,353 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:27,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1672938315, now seen corresponding path program 1 times [2024-11-20 00:09:27,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:27,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235874183] [2024-11-20 00:09:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:27,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,530 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-20 00:09:27,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:27,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235874183] [2024-11-20 00:09:27,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235874183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:27,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:27,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:09:27,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095212656] [2024-11-20 00:09:27,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:27,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:09:27,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:27,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:09:27,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:09:27,534 INFO L87 Difference]: Start difference. First operand 1849 states and 2502 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-20 00:09:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:28,823 INFO L93 Difference]: Finished difference Result 3284 states and 4341 transitions. [2024-11-20 00:09:28,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 00:09:28,823 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-20 00:09:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:28,834 INFO L225 Difference]: With dead ends: 3284 [2024-11-20 00:09:28,834 INFO L226 Difference]: Without dead ends: 2047 [2024-11-20 00:09:28,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-20 00:09:28,838 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 1392 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:28,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1420 Valid, 2086 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 00:09:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2024-11-20 00:09:28,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1827. [2024-11-20 00:09:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1489 states have (on average 1.3613163196776359) internal successors, (2027), 1512 states have internal predecessors, (2027), 180 states have call successors, (180), 131 states have call predecessors, (180), 156 states have return successors, (255), 187 states have call predecessors, (255), 176 states have call successors, (255) [2024-11-20 00:09:28,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2462 transitions. [2024-11-20 00:09:28,982 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2462 transitions. Word has length 65 [2024-11-20 00:09:28,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:28,984 INFO L471 AbstractCegarLoop]: Abstraction has 1827 states and 2462 transitions. [2024-11-20 00:09:28,985 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-20 00:09:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2462 transitions. [2024-11-20 00:09:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:09:28,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:28,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:28,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 00:09:28,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:28,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:28,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1538924809, now seen corresponding path program 1 times [2024-11-20 00:09:28,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:28,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738329631] [2024-11-20 00:09:28,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:28,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:29,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:29,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:29,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:29,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:29,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:29,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:29,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:29,128 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-20 00:09:29,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:29,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738329631] [2024-11-20 00:09:29,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738329631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:29,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:29,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:09:29,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212232844] [2024-11-20 00:09:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:29,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:09:29,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:29,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:09:29,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:09:29,131 INFO L87 Difference]: Start difference. First operand 1827 states and 2462 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-20 00:09:29,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:29,994 INFO L93 Difference]: Finished difference Result 4902 states and 6441 transitions. [2024-11-20 00:09:29,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 00:09:29,995 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-20 00:09:29,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:30,013 INFO L225 Difference]: With dead ends: 4902 [2024-11-20 00:09:30,013 INFO L226 Difference]: Without dead ends: 3470 [2024-11-20 00:09:30,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-20 00:09:30,020 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 1693 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:30,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1725 Valid, 1413 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:09:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2024-11-20 00:09:30,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3198. [2024-11-20 00:09:30,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3198 states, 2555 states have (on average 1.3088062622309198) internal successors, (3344), 2599 states have internal predecessors, (3344), 332 states have call successors, (332), 254 states have call predecessors, (332), 309 states have return successors, (527), 351 states have call predecessors, (527), 328 states have call successors, (527) [2024-11-20 00:09:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 4203 transitions. [2024-11-20 00:09:30,254 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 4203 transitions. Word has length 65 [2024-11-20 00:09:30,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:30,255 INFO L471 AbstractCegarLoop]: Abstraction has 3198 states and 4203 transitions. [2024-11-20 00:09:30,255 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-20 00:09:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 4203 transitions. [2024-11-20 00:09:30,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 00:09:30,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:30,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:30,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 00:09:30,260 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:30,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:30,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1144595020, now seen corresponding path program 1 times [2024-11-20 00:09:30,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:30,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792533478] [2024-11-20 00:09:30,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:30,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:30,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:30,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:30,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:30,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:30,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:30,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:30,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:30,334 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-20 00:09:30,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:30,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792533478] [2024-11-20 00:09:30,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792533478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:30,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:30,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:09:30,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045460269] [2024-11-20 00:09:30,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:30,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:09:30,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:30,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:09:30,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:09:30,338 INFO L87 Difference]: Start difference. First operand 3198 states and 4203 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-20 00:09:31,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:31,255 INFO L93 Difference]: Finished difference Result 8216 states and 10717 transitions. [2024-11-20 00:09:31,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:09:31,255 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-20 00:09:31,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:31,283 INFO L225 Difference]: With dead ends: 8216 [2024-11-20 00:09:31,283 INFO L226 Difference]: Without dead ends: 5392 [2024-11-20 00:09:31,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:09:31,292 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 1126 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:31,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 1425 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:09:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5392 states. [2024-11-20 00:09:31,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5392 to 4876. [2024-11-20 00:09:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 3840 states have (on average 1.2875) internal successors, (4944), 3891 states have internal predecessors, (4944), 526 states have call successors, (526), 428 states have call predecessors, (526), 508 states have return successors, (848), 563 states have call predecessors, (848), 522 states have call successors, (848) [2024-11-20 00:09:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 6318 transitions. [2024-11-20 00:09:31,648 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 6318 transitions. Word has length 66 [2024-11-20 00:09:31,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:31,648 INFO L471 AbstractCegarLoop]: Abstraction has 4876 states and 6318 transitions. [2024-11-20 00:09:31,648 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-20 00:09:31,648 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 6318 transitions. [2024-11-20 00:09:31,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 00:09:31,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:31,650 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:31,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 00:09:31,651 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:31,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:31,651 INFO L85 PathProgramCache]: Analyzing trace with hash 196552871, now seen corresponding path program 1 times [2024-11-20 00:09:31,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:31,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906847765] [2024-11-20 00:09:31,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:31,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:31,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:31,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:31,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:31,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:31,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:31,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:31,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:31,768 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-20 00:09:31,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:31,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906847765] [2024-11-20 00:09:31,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906847765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:31,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:31,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:09:31,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767590111] [2024-11-20 00:09:31,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:31,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:09:31,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:31,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:09:31,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:09:31,771 INFO L87 Difference]: Start difference. First operand 4876 states and 6318 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-20 00:09:32,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:32,845 INFO L93 Difference]: Finished difference Result 6506 states and 8320 transitions. [2024-11-20 00:09:32,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 00:09:32,846 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-20 00:09:32,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:32,874 INFO L225 Difference]: With dead ends: 6506 [2024-11-20 00:09:32,874 INFO L226 Difference]: Without dead ends: 6503 [2024-11-20 00:09:32,876 INFO L431 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-20 00:09:32,876 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 2032 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2041 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:32,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2041 Valid, 1448 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:09:32,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6503 states. [2024-11-20 00:09:33,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6503 to 5930. [2024-11-20 00:09:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5930 states, 4643 states have (on average 1.2737454232177472) internal successors, (5914), 4703 states have internal predecessors, (5914), 652 states have call successors, (652), 542 states have call predecessors, (652), 633 states have return successors, (1041), 691 states have call predecessors, (1041), 649 states have call successors, (1041) [2024-11-20 00:09:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5930 states to 5930 states and 7607 transitions. [2024-11-20 00:09:33,288 INFO L78 Accepts]: Start accepts. Automaton has 5930 states and 7607 transitions. Word has length 73 [2024-11-20 00:09:33,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:33,288 INFO L471 AbstractCegarLoop]: Abstraction has 5930 states and 7607 transitions. [2024-11-20 00:09:33,289 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-20 00:09:33,289 INFO L276 IsEmpty]: Start isEmpty. Operand 5930 states and 7607 transitions. [2024-11-20 00:09:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-20 00:09:33,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:33,291 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:33,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 00:09:33,291 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:33,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:33,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1796772021, now seen corresponding path program 1 times [2024-11-20 00:09:33,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:33,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698425914] [2024-11-20 00:09:33,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:33,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:33,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:33,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:33,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:33,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:33,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:33,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:33,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:33,448 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-20 00:09:33,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:33,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698425914] [2024-11-20 00:09:33,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698425914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:09:33,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220378435] [2024-11-20 00:09:33,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:33,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:09:33,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:09:33,452 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-20 00:09:33,453 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-20 00:09:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:33,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 00:09:33,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:09:33,867 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-20 00:09:33,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 00:09:33,968 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-20 00:09:33,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220378435] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 00:09:33,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 00:09:33,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-11-20 00:09:33,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499589981] [2024-11-20 00:09:33,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 00:09:33,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 00:09:33,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:33,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 00:09:33,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 00:09:33,971 INFO L87 Difference]: Start difference. First operand 5930 states and 7607 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-20 00:09:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:36,373 INFO L93 Difference]: Finished difference Result 13576 states and 17135 transitions. [2024-11-20 00:09:36,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-20 00:09:36,374 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-20 00:09:36,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:36,450 INFO L225 Difference]: With dead ends: 13576 [2024-11-20 00:09:36,451 INFO L226 Difference]: Without dead ends: 13573 [2024-11-20 00:09:36,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-11-20 00:09:36,458 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 2511 mSDsluCounter, 1967 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2579 SdHoareTripleChecker+Valid, 2465 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:36,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2579 Valid, 2465 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:09:36,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13573 states. [2024-11-20 00:09:37,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13573 to 11188. [2024-11-20 00:09:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11188 states, 8735 states have (on average 1.2619347452776188) internal successors, (11023), 8847 states have internal predecessors, (11023), 1218 states have call successors, (1218), 1032 states have call predecessors, (1218), 1233 states have return successors, (1980), 1315 states have call predecessors, (1980), 1215 states have call successors, (1980) [2024-11-20 00:09:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11188 states to 11188 states and 14221 transitions. [2024-11-20 00:09:37,540 INFO L78 Accepts]: Start accepts. Automaton has 11188 states and 14221 transitions. Word has length 74 [2024-11-20 00:09:37,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:37,541 INFO L471 AbstractCegarLoop]: Abstraction has 11188 states and 14221 transitions. [2024-11-20 00:09:37,542 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-20 00:09:37,542 INFO L276 IsEmpty]: Start isEmpty. Operand 11188 states and 14221 transitions. [2024-11-20 00:09:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 00:09:37,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:37,546 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:37,556 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-20 00:09:37,746 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,SelfDestructingSolverStorable9 [2024-11-20 00:09:37,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:37,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:37,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2130315609, now seen corresponding path program 2 times [2024-11-20 00:09:37,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:37,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923966414] [2024-11-20 00:09:37,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:37,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:37,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:37,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:37,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:37,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:37,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:37,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:37,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:37,823 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-20 00:09:37,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:37,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923966414] [2024-11-20 00:09:37,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923966414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:37,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:37,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:09:37,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657522102] [2024-11-20 00:09:37,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:37,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:09:37,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:37,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:09:37,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:09:37,826 INFO L87 Difference]: Start difference. First operand 11188 states and 14221 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-20 00:09:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:39,069 INFO L93 Difference]: Finished difference Result 17731 states and 22563 transitions. [2024-11-20 00:09:39,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 00:09:39,069 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-20 00:09:39,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:39,102 INFO L225 Difference]: With dead ends: 17731 [2024-11-20 00:09:39,103 INFO L226 Difference]: Without dead ends: 7793 [2024-11-20 00:09:39,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-20 00:09:39,128 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 1261 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:39,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 1536 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:09:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7793 states. [2024-11-20 00:09:39,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7793 to 7241. [2024-11-20 00:09:39,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7241 states, 5682 states have (on average 1.2430482224568813) internal successors, (7063), 5750 states have internal predecessors, (7063), 785 states have call successors, (785), 656 states have call predecessors, (785), 772 states have return successors, (1199), 841 states have call predecessors, (1199), 782 states have call successors, (1199) [2024-11-20 00:09:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7241 states to 7241 states and 9047 transitions. [2024-11-20 00:09:39,796 INFO L78 Accepts]: Start accepts. Automaton has 7241 states and 9047 transitions. Word has length 77 [2024-11-20 00:09:39,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:39,796 INFO L471 AbstractCegarLoop]: Abstraction has 7241 states and 9047 transitions. [2024-11-20 00:09:39,797 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-20 00:09:39,797 INFO L276 IsEmpty]: Start isEmpty. Operand 7241 states and 9047 transitions. [2024-11-20 00:09:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-20 00:09:39,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:39,800 INFO L215 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-20 00:09:39,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 00:09:39,801 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:39,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:39,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1668605415, now seen corresponding path program 1 times [2024-11-20 00:09:39,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:39,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959262681] [2024-11-20 00:09:39,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:39,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:39,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:39,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:39,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:39,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:39,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:39,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:39,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:39,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 00:09:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:39,900 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-20 00:09:39,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:39,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959262681] [2024-11-20 00:09:39,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959262681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:39,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:39,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:09:39,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391560072] [2024-11-20 00:09:39,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:39,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:09:39,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:39,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:09:39,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:09:39,903 INFO L87 Difference]: Start difference. First operand 7241 states and 9047 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-20 00:09:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:42,237 INFO L93 Difference]: Finished difference Result 21115 states and 26264 transitions. [2024-11-20 00:09:42,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 00:09:42,237 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-20 00:09:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:42,299 INFO L225 Difference]: With dead ends: 21115 [2024-11-20 00:09:42,300 INFO L226 Difference]: Without dead ends: 14272 [2024-11-20 00:09:42,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-20 00:09:42,323 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 1375 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:42,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 1872 Invalid, 1575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 00:09:42,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14272 states. [2024-11-20 00:09:43,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14272 to 13413. [2024-11-20 00:09:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13413 states, 10358 states have (on average 1.2116238656111218) internal successors, (12550), 10532 states have internal predecessors, (12550), 1501 states have call successors, (1501), 1260 states have call predecessors, (1501), 1552 states have return successors, (2602), 1633 states have call predecessors, (2602), 1498 states have call successors, (2602) [2024-11-20 00:09:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13413 states to 13413 states and 16653 transitions. [2024-11-20 00:09:43,700 INFO L78 Accepts]: Start accepts. Automaton has 13413 states and 16653 transitions. Word has length 84 [2024-11-20 00:09:43,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:43,700 INFO L471 AbstractCegarLoop]: Abstraction has 13413 states and 16653 transitions. [2024-11-20 00:09:43,701 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-20 00:09:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 13413 states and 16653 transitions. [2024-11-20 00:09:43,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-20 00:09:43,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:43,711 INFO L215 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-20 00:09:43,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 00:09:43,711 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:43,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:43,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2003839205, now seen corresponding path program 1 times [2024-11-20 00:09:43,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:43,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494919054] [2024-11-20 00:09:43,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:43,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:43,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:43,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:43,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:43,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:43,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:43,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:43,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:43,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:09:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:43,860 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-20 00:09:43,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:43,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494919054] [2024-11-20 00:09:43,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494919054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:43,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:43,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:09:43,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174026002] [2024-11-20 00:09:43,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:43,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:09:43,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:43,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:09:43,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:09:43,864 INFO L87 Difference]: Start difference. First operand 13413 states and 16653 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-20 00:09:46,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:46,134 INFO L93 Difference]: Finished difference Result 24287 states and 29972 transitions. [2024-11-20 00:09:46,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-20 00:09:46,135 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-20 00:09:46,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:46,186 INFO L225 Difference]: With dead ends: 24287 [2024-11-20 00:09:46,187 INFO L226 Difference]: Without dead ends: 11888 [2024-11-20 00:09:46,219 INFO L431 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-20 00:09:46,220 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 2349 mSDsluCounter, 1849 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2394 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:46,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2394 Valid, 2265 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 1595 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:09:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11888 states. [2024-11-20 00:09:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11888 to 10988. [2024-11-20 00:09:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10988 states, 8524 states have (on average 1.2037775692163304) internal successors, (10261), 8665 states have internal predecessors, (10261), 1202 states have call successors, (1202), 1009 states have call predecessors, (1202), 1260 states have return successors, (1934), 1323 states have call predecessors, (1934), 1199 states have call successors, (1934) [2024-11-20 00:09:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10988 states to 10988 states and 13397 transitions. [2024-11-20 00:09:47,237 INFO L78 Accepts]: Start accepts. Automaton has 10988 states and 13397 transitions. Word has length 93 [2024-11-20 00:09:47,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:47,237 INFO L471 AbstractCegarLoop]: Abstraction has 10988 states and 13397 transitions. [2024-11-20 00:09:47,237 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-20 00:09:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 10988 states and 13397 transitions. [2024-11-20 00:09:47,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 00:09:47,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:47,250 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-20 00:09:47,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 00:09:47,251 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:47,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:47,251 INFO L85 PathProgramCache]: Analyzing trace with hash -991055369, now seen corresponding path program 1 times [2024-11-20 00:09:47,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:47,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195910618] [2024-11-20 00:09:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:47,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 00:09:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 00:09:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 00:09:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 00:09:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:09:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 00:09:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 00:09:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-20 00:09:47,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:47,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195910618] [2024-11-20 00:09:47,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195910618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:09:47,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600560187] [2024-11-20 00:09:47,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:47,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:09:47,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:09:47,430 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:09:47,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 00:09:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 00:09:47,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:09:47,621 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 00:09:47,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:09:47,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600560187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:47,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:09:47,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-20 00:09:47,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395015112] [2024-11-20 00:09:47,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:47,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:09:47,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:47,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:09:47,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-20 00:09:47,626 INFO L87 Difference]: Start difference. First operand 10988 states and 13397 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 00:09:48,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:48,090 INFO L93 Difference]: Finished difference Result 15848 states and 19214 transitions. [2024-11-20 00:09:48,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:09:48,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-11-20 00:09:48,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:48,110 INFO L225 Difference]: With dead ends: 15848 [2024-11-20 00:09:48,111 INFO L226 Difference]: Without dead ends: 5266 [2024-11-20 00:09:48,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-20 00:09:48,134 INFO L432 NwaCegarLoop]: 705 mSDtfsCounter, 0 mSDsluCounter, 2811 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3516 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:48,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3516 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:09:48,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2024-11-20 00:09:48,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 5112. [2024-11-20 00:09:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5112 states, 4089 states have (on average 1.2049400831499144) internal successors, (4927), 4128 states have internal predecessors, (4927), 504 states have call successors, (504), 403 states have call predecessors, (504), 517 states have return successors, (774), 581 states have call predecessors, (774), 501 states have call successors, (774) [2024-11-20 00:09:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 6205 transitions. [2024-11-20 00:09:48,750 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 6205 transitions. Word has length 145 [2024-11-20 00:09:48,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:48,750 INFO L471 AbstractCegarLoop]: Abstraction has 5112 states and 6205 transitions. [2024-11-20 00:09:48,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 00:09:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 6205 transitions. [2024-11-20 00:09:48,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 00:09:48,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:48,761 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-20 00:09:48,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 00:09:48,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-20 00:09:48,961 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:48,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:48,962 INFO L85 PathProgramCache]: Analyzing trace with hash 480456951, now seen corresponding path program 1 times [2024-11-20 00:09:48,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:48,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129580744] [2024-11-20 00:09:48,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:48,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:49,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:49,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:49,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:49,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:49,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:49,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:49,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:49,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 00:09:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:49,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 00:09:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:49,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 00:09:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:49,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 00:09:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:49,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:49,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:49,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 00:09:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 00:09:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:49,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 00:09:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-20 00:09:49,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:49,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129580744] [2024-11-20 00:09:49,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129580744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:49,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:49,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:09:49,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800141785] [2024-11-20 00:09:49,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:49,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:09:49,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:49,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:09:49,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:09:49,098 INFO L87 Difference]: Start difference. First operand 5112 states and 6205 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 00:09:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:50,301 INFO L93 Difference]: Finished difference Result 5660 states and 6823 transitions. [2024-11-20 00:09:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:09:50,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2024-11-20 00:09:50,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:50,325 INFO L225 Difference]: With dead ends: 5660 [2024-11-20 00:09:50,325 INFO L226 Difference]: Without dead ends: 4911 [2024-11-20 00:09:50,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-20 00:09:50,330 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 1015 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:50,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 1349 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:09:50,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4911 states. [2024-11-20 00:09:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4911 to 4687. [2024-11-20 00:09:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4687 states, 3760 states have (on average 1.209308510638298) internal successors, (4547), 3796 states have internal predecessors, (4547), 458 states have call successors, (458), 363 states have call predecessors, (458), 467 states have return successors, (710), 528 states have call predecessors, (710), 455 states have call successors, (710) [2024-11-20 00:09:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 5715 transitions. [2024-11-20 00:09:50,915 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 5715 transitions. Word has length 147 [2024-11-20 00:09:50,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:50,916 INFO L471 AbstractCegarLoop]: Abstraction has 4687 states and 5715 transitions. [2024-11-20 00:09:50,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 00:09:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 5715 transitions. [2024-11-20 00:09:50,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 00:09:50,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:50,926 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:09:50,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 00:09:50,926 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:50,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:50,927 INFO L85 PathProgramCache]: Analyzing trace with hash -840430950, now seen corresponding path program 1 times [2024-11-20 00:09:50,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:50,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235602602] [2024-11-20 00:09:50,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:50,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 00:09:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:09:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:09:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:09:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 00:09:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 00:09:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 00:09:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 00:09:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 00:09:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-20 00:09:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:09:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,101 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 00:09:51,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:51,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235602602] [2024-11-20 00:09:51,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235602602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:09:51,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604185648] [2024-11-20 00:09:51,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:51,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:09:51,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:09:51,108 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:09:51,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 00:09:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:51,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 00:09:51,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:09:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-20 00:09:51,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:09:51,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604185648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:51,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:09:51,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-20 00:09:51,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465793636] [2024-11-20 00:09:51,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:51,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:09:51,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:09:51,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:09:51,389 INFO L87 Difference]: Start difference. First operand 4687 states and 5715 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 00:09:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:51,807 INFO L93 Difference]: Finished difference Result 6523 states and 7875 transitions. [2024-11-20 00:09:51,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:09:51,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 158 [2024-11-20 00:09:51,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:51,817 INFO L225 Difference]: With dead ends: 6523 [2024-11-20 00:09:51,817 INFO L226 Difference]: Without dead ends: 2483 [2024-11-20 00:09:51,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:09:51,821 INFO L432 NwaCegarLoop]: 703 mSDtfsCounter, 615 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:51,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 808 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:09:51,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2024-11-20 00:09:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2483. [2024-11-20 00:09:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2026 states have (on average 1.228035538005923) internal successors, (2488), 2046 states have internal predecessors, (2488), 229 states have call successors, (229), 175 states have call predecessors, (229), 226 states have return successors, (328), 262 states have call predecessors, (328), 226 states have call successors, (328) [2024-11-20 00:09:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3045 transitions. [2024-11-20 00:09:52,029 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3045 transitions. Word has length 158 [2024-11-20 00:09:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:52,029 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3045 transitions. [2024-11-20 00:09:52,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 00:09:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3045 transitions. [2024-11-20 00:09:52,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-20 00:09:52,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:52,035 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:52,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 00:09:52,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:09:52,235 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:52,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash 560707697, now seen corresponding path program 1 times [2024-11-20 00:09:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:52,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842613293] [2024-11-20 00:09:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:52,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 00:09:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 00:09:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 00:09:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:09:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-20 00:09:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 00:09:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 00:09:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-20 00:09:52,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:52,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842613293] [2024-11-20 00:09:52,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842613293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:52,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:52,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:09:52,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981349951] [2024-11-20 00:09:52,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:52,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:09:52,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:52,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:09:52,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:09:52,357 INFO L87 Difference]: Start difference. First operand 2483 states and 3045 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 00:09:53,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:53,211 INFO L93 Difference]: Finished difference Result 4347 states and 5255 transitions. [2024-11-20 00:09:53,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 00:09:53,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2024-11-20 00:09:53,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:53,225 INFO L225 Difference]: With dead ends: 4347 [2024-11-20 00:09:53,226 INFO L226 Difference]: Without dead ends: 2586 [2024-11-20 00:09:53,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:09:53,232 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 642 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:53,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 2163 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:09:53,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2024-11-20 00:09:53,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 2042. [2024-11-20 00:09:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1677 states have (on average 1.2468694096601074) internal successors, (2091), 1696 states have internal predecessors, (2091), 185 states have call successors, (185), 139 states have call predecessors, (185), 178 states have return successors, (260), 207 states have call predecessors, (260), 182 states have call successors, (260) [2024-11-20 00:09:53,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2536 transitions. [2024-11-20 00:09:53,421 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2536 transitions. Word has length 159 [2024-11-20 00:09:53,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:53,421 INFO L471 AbstractCegarLoop]: Abstraction has 2042 states and 2536 transitions. [2024-11-20 00:09:53,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 00:09:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2536 transitions. [2024-11-20 00:09:53,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-20 00:09:53,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:53,426 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:09:53,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 00:09:53,426 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:53,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:53,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1574976668, now seen corresponding path program 1 times [2024-11-20 00:09:53,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:53,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17564893] [2024-11-20 00:09:53,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:53,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 00:09:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 00:09:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 00:09:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 00:09:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 00:09:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 00:09:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 00:09:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-20 00:09:53,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:53,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17564893] [2024-11-20 00:09:53,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17564893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:09:53,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122352873] [2024-11-20 00:09:53,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:53,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:09:53,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:09:53,649 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:09:53,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 00:09:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 00:09:53,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:09:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-20 00:09:53,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 00:09:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-20 00:09:54,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122352873] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 00:09:54,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 00:09:54,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2024-11-20 00:09:54,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980642159] [2024-11-20 00:09:54,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 00:09:54,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 00:09:54,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:54,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 00:09:54,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-20 00:09:54,171 INFO L87 Difference]: Start difference. First operand 2042 states and 2536 transitions. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-11-20 00:09:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:55,614 INFO L93 Difference]: Finished difference Result 4077 states and 5014 transitions. [2024-11-20 00:09:55,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-20 00:09:55,615 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 162 [2024-11-20 00:09:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:55,624 INFO L225 Difference]: With dead ends: 4077 [2024-11-20 00:09:55,624 INFO L226 Difference]: Without dead ends: 2329 [2024-11-20 00:09:55,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2024-11-20 00:09:55,626 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 2011 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2042 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 2312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:55,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2042 Valid, 2051 Invalid, 2312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 2007 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 00:09:55,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2024-11-20 00:09:55,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 2129. [2024-11-20 00:09:55,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2129 states, 1722 states have (on average 1.2224157955865274) internal successors, (2105), 1746 states have internal predecessors, (2105), 207 states have call successors, (207), 163 states have call predecessors, (207), 198 states have return successors, (311), 220 states have call predecessors, (311), 204 states have call successors, (311) [2024-11-20 00:09:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 2623 transitions. [2024-11-20 00:09:55,826 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 2623 transitions. Word has length 162 [2024-11-20 00:09:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:55,827 INFO L471 AbstractCegarLoop]: Abstraction has 2129 states and 2623 transitions. [2024-11-20 00:09:55,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-11-20 00:09:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2623 transitions. [2024-11-20 00:09:55,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:09:55,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:55,831 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:09:55,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 00:09:56,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-20 00:09:56,033 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:56,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:56,033 INFO L85 PathProgramCache]: Analyzing trace with hash -727196661, now seen corresponding path program 1 times [2024-11-20 00:09:56,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:56,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809727001] [2024-11-20 00:09:56,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:56,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 00:09:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:09:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:09:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:09:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 00:09:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 00:09:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 00:09:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 00:09:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 00:09:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 00:09:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 00:09:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:09:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-20 00:09:56,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:56,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809727001] [2024-11-20 00:09:56,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809727001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:09:56,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061293400] [2024-11-20 00:09:56,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:56,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:09:56,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:09:56,172 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:09:56,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 00:09:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:56,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 00:09:56,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:09:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-20 00:09:56,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:09:56,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061293400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:56,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:09:56,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-20 00:09:56,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789665847] [2024-11-20 00:09:56,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:56,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:09:56,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:56,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:09:56,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 00:09:56,355 INFO L87 Difference]: Start difference. First operand 2129 states and 2623 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 00:09:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:57,092 INFO L93 Difference]: Finished difference Result 3774 states and 4546 transitions. [2024-11-20 00:09:57,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:09:57,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 179 [2024-11-20 00:09:57,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:57,104 INFO L225 Difference]: With dead ends: 3774 [2024-11-20 00:09:57,104 INFO L226 Difference]: Without dead ends: 1846 [2024-11-20 00:09:57,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-20 00:09:57,107 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 951 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:57,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 1081 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:09:57,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2024-11-20 00:09:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1809. [2024-11-20 00:09:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1478 states have (on average 1.2280108254397835) internal successors, (1815), 1493 states have internal predecessors, (1815), 172 states have call successors, (172), 131 states have call predecessors, (172), 157 states have return successors, (239), 185 states have call predecessors, (239), 169 states have call successors, (239) [2024-11-20 00:09:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2226 transitions. [2024-11-20 00:09:57,286 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2226 transitions. Word has length 179 [2024-11-20 00:09:57,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:57,287 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2226 transitions. [2024-11-20 00:09:57,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 00:09:57,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2226 transitions. [2024-11-20 00:09:57,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 00:09:57,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:57,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:57,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 00:09:57,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:09:57,492 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:57,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:57,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1741063594, now seen corresponding path program 1 times [2024-11-20 00:09:57,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:57,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614917689] [2024-11-20 00:09:57,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:57,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:09:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:09:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 00:09:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:09:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,705 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-20 00:09:57,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:57,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614917689] [2024-11-20 00:09:57,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614917689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:57,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:57,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:09:57,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534291500] [2024-11-20 00:09:57,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:57,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:09:57,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:57,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:09:57,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:09:57,709 INFO L87 Difference]: Start difference. First operand 1809 states and 2226 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:09:59,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:59,514 INFO L93 Difference]: Finished difference Result 2304 states and 3020 transitions. [2024-11-20 00:09:59,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:09:59,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-20 00:09:59,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:59,522 INFO L225 Difference]: With dead ends: 2304 [2024-11-20 00:09:59,522 INFO L226 Difference]: Without dead ends: 1940 [2024-11-20 00:09:59,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:09:59,524 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 1086 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:59,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 989 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:09:59,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2024-11-20 00:09:59,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1809. [2024-11-20 00:09:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1478 states have (on average 1.2273342354533152) internal successors, (1814), 1493 states have internal predecessors, (1814), 172 states have call successors, (172), 131 states have call predecessors, (172), 157 states have return successors, (239), 185 states have call predecessors, (239), 169 states have call successors, (239) [2024-11-20 00:09:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2225 transitions. [2024-11-20 00:09:59,831 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2225 transitions. Word has length 168 [2024-11-20 00:09:59,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:59,832 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2225 transitions. [2024-11-20 00:09:59,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:09:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2225 transitions. [2024-11-20 00:09:59,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 00:09:59,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:59,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:59,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 00:09:59,835 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:59,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:59,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1886521812, now seen corresponding path program 1 times [2024-11-20 00:09:59,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:59,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590869517] [2024-11-20 00:09:59,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:59,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:59,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:59,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:09:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:59,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:09:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:59,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 00:09:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:59,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:10:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:00,001 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-20 00:10:00,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:00,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590869517] [2024-11-20 00:10:00,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590869517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:00,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:00,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:10:00,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211003717] [2024-11-20 00:10:00,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:00,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:10:00,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:00,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:10:00,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:10:00,003 INFO L87 Difference]: Start difference. First operand 1809 states and 2225 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:01,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:01,734 INFO L93 Difference]: Finished difference Result 2296 states and 3003 transitions. [2024-11-20 00:10:01,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:10:01,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-20 00:10:01,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:01,742 INFO L225 Difference]: With dead ends: 2296 [2024-11-20 00:10:01,742 INFO L226 Difference]: Without dead ends: 1940 [2024-11-20 00:10:01,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:10:01,744 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 1077 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:01,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 987 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:10:01,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2024-11-20 00:10:02,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1809. [2024-11-20 00:10:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1478 states have (on average 1.2266576454668472) internal successors, (1813), 1493 states have internal predecessors, (1813), 172 states have call successors, (172), 131 states have call predecessors, (172), 157 states have return successors, (239), 185 states have call predecessors, (239), 169 states have call successors, (239) [2024-11-20 00:10:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2224 transitions. [2024-11-20 00:10:02,030 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2224 transitions. Word has length 168 [2024-11-20 00:10:02,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:02,030 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2224 transitions. [2024-11-20 00:10:02,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:02,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2224 transitions. [2024-11-20 00:10:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 00:10:02,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:02,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:02,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 00:10:02,032 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:02,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:02,033 INFO L85 PathProgramCache]: Analyzing trace with hash 439940946, now seen corresponding path program 1 times [2024-11-20 00:10:02,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:02,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656734073] [2024-11-20 00:10:02,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:02,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:02,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:02,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:02,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:10:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:02,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 00:10:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:02,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:10:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:02,241 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-20 00:10:02,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:02,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656734073] [2024-11-20 00:10:02,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656734073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:02,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:02,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:10:02,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402316211] [2024-11-20 00:10:02,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:02,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:10:02,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:02,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:10:02,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:10:02,244 INFO L87 Difference]: Start difference. First operand 1809 states and 2224 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:04,762 INFO L93 Difference]: Finished difference Result 2791 states and 3799 transitions. [2024-11-20 00:10:04,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:10:04,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-20 00:10:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:04,771 INFO L225 Difference]: With dead ends: 2791 [2024-11-20 00:10:04,771 INFO L226 Difference]: Without dead ends: 2439 [2024-11-20 00:10:04,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:10:04,772 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 1688 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 2454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:04,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1716 Valid, 1641 Invalid, 2454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-20 00:10:04,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2024-11-20 00:10:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 2176. [2024-11-20 00:10:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 1818 states have (on average 1.2926292629262925) internal successors, (2350), 1834 states have internal predecessors, (2350), 192 states have call successors, (192), 137 states have call predecessors, (192), 164 states have return successors, (262), 205 states have call predecessors, (262), 189 states have call successors, (262) [2024-11-20 00:10:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 2804 transitions. [2024-11-20 00:10:05,020 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 2804 transitions. Word has length 168 [2024-11-20 00:10:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:05,020 INFO L471 AbstractCegarLoop]: Abstraction has 2176 states and 2804 transitions. [2024-11-20 00:10:05,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 2804 transitions. [2024-11-20 00:10:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 00:10:05,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:05,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:05,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 00:10:05,023 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:05,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:05,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1362341454, now seen corresponding path program 1 times [2024-11-20 00:10:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:05,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040696110] [2024-11-20 00:10:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:05,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:05,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:05,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:05,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:10:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:05,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 00:10:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:05,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:10:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:05,297 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-20 00:10:05,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:05,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040696110] [2024-11-20 00:10:05,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040696110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:05,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:05,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:05,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646457114] [2024-11-20 00:10:05,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:05,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:05,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:05,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:05,300 INFO L87 Difference]: Start difference. First operand 2176 states and 2804 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:08,694 INFO L93 Difference]: Finished difference Result 3673 states and 5208 transitions. [2024-11-20 00:10:08,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:10:08,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-20 00:10:08,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:08,709 INFO L225 Difference]: With dead ends: 3673 [2024-11-20 00:10:08,709 INFO L226 Difference]: Without dead ends: 2954 [2024-11-20 00:10:08,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:10:08,712 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 1725 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 3571 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1753 SdHoareTripleChecker+Valid, 2763 SdHoareTripleChecker+Invalid, 3668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:08,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1753 Valid, 2763 Invalid, 3668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3571 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-20 00:10:08,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2024-11-20 00:10:08,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2518. [2024-11-20 00:10:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2133 states have (on average 1.3300515705578997) internal successors, (2837), 2150 states have internal predecessors, (2837), 212 states have call successors, (212), 143 states have call predecessors, (212), 171 states have return successors, (284), 226 states have call predecessors, (284), 209 states have call successors, (284) [2024-11-20 00:10:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 3333 transitions. [2024-11-20 00:10:09,008 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 3333 transitions. Word has length 168 [2024-11-20 00:10:09,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:09,008 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 3333 transitions. [2024-11-20 00:10:09,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:09,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 3333 transitions. [2024-11-20 00:10:09,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 00:10:09,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:09,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:09,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 00:10:09,010 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:09,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1035646384, now seen corresponding path program 1 times [2024-11-20 00:10:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:09,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626734234] [2024-11-20 00:10:09,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:09,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:09,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:09,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:09,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:10:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:09,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 00:10:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:09,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:10:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:09,241 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-20 00:10:09,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:09,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626734234] [2024-11-20 00:10:09,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626734234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:09,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:09,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:09,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070960680] [2024-11-20 00:10:09,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:09,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:09,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:09,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:09,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:09,244 INFO L87 Difference]: Start difference. First operand 2518 states and 3333 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:11,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:11,067 INFO L93 Difference]: Finished difference Result 4029 states and 5773 transitions. [2024-11-20 00:10:11,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:10:11,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-20 00:10:11,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:11,077 INFO L225 Difference]: With dead ends: 4029 [2024-11-20 00:10:11,077 INFO L226 Difference]: Without dead ends: 2968 [2024-11-20 00:10:11,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:10:11,079 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 1378 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1407 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:11,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1407 Valid, 1518 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 00:10:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2024-11-20 00:10:11,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2518. [2024-11-20 00:10:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2133 states have (on average 1.3286451007969995) internal successors, (2834), 2150 states have internal predecessors, (2834), 212 states have call successors, (212), 143 states have call predecessors, (212), 171 states have return successors, (284), 226 states have call predecessors, (284), 209 states have call successors, (284) [2024-11-20 00:10:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 3330 transitions. [2024-11-20 00:10:11,354 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 3330 transitions. Word has length 168 [2024-11-20 00:10:11,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:11,355 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 3330 transitions. [2024-11-20 00:10:11,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 3330 transitions. [2024-11-20 00:10:11,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 00:10:11,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:11,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:11,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 00:10:11,356 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:11,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:11,357 INFO L85 PathProgramCache]: Analyzing trace with hash -609091886, now seen corresponding path program 1 times [2024-11-20 00:10:11,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:11,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540199826] [2024-11-20 00:10:11,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:11,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:11,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:11,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:11,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:10:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:11,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 00:10:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:11,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:10:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:11,586 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-20 00:10:11,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:11,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540199826] [2024-11-20 00:10:11,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540199826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:11,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:11,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:11,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092647868] [2024-11-20 00:10:11,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:11,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:11,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:11,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:11,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:11,588 INFO L87 Difference]: Start difference. First operand 2518 states and 3330 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:13,442 INFO L93 Difference]: Finished difference Result 4025 states and 5756 transitions. [2024-11-20 00:10:13,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:10:13,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-20 00:10:13,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:13,456 INFO L225 Difference]: With dead ends: 4025 [2024-11-20 00:10:13,456 INFO L226 Difference]: Without dead ends: 2964 [2024-11-20 00:10:13,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:10:13,459 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 1294 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:13,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 1519 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 00:10:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2024-11-20 00:10:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 2518. [2024-11-20 00:10:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2133 states have (on average 1.3272386310360993) internal successors, (2831), 2150 states have internal predecessors, (2831), 212 states have call successors, (212), 143 states have call predecessors, (212), 171 states have return successors, (284), 226 states have call predecessors, (284), 209 states have call successors, (284) [2024-11-20 00:10:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 3327 transitions. [2024-11-20 00:10:13,746 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 3327 transitions. Word has length 168 [2024-11-20 00:10:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:13,746 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 3327 transitions. [2024-11-20 00:10:13,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 3327 transitions. [2024-11-20 00:10:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 00:10:13,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:13,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:13,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 00:10:13,748 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:13,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:13,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1149521392, now seen corresponding path program 1 times [2024-11-20 00:10:13,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:13,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053921249] [2024-11-20 00:10:13,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:13,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:13,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:13,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:13,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:10:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:13,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 00:10:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:14,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:10:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:14,005 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-20 00:10:14,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:14,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053921249] [2024-11-20 00:10:14,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053921249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:14,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:14,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:14,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143225470] [2024-11-20 00:10:14,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:14,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:14,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:14,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:14,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:14,008 INFO L87 Difference]: Start difference. First operand 2518 states and 3327 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:17,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:17,346 INFO L93 Difference]: Finished difference Result 4965 states and 7225 transitions. [2024-11-20 00:10:17,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:10:17,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-20 00:10:17,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:17,361 INFO L225 Difference]: With dead ends: 4965 [2024-11-20 00:10:17,362 INFO L226 Difference]: Without dead ends: 3904 [2024-11-20 00:10:17,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:10:17,369 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 1705 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 3500 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1733 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 3599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:17,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1733 Valid, 2761 Invalid, 3599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3500 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-20 00:10:17,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2024-11-20 00:10:17,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 3212. [2024-11-20 00:10:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 2773 states have (on average 1.3761269383339343) internal successors, (3816), 2792 states have internal predecessors, (3816), 252 states have call successors, (252), 155 states have call predecessors, (252), 185 states have return successors, (332), 268 states have call predecessors, (332), 249 states have call successors, (332) [2024-11-20 00:10:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 4400 transitions. [2024-11-20 00:10:17,737 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 4400 transitions. Word has length 168 [2024-11-20 00:10:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:17,737 INFO L471 AbstractCegarLoop]: Abstraction has 3212 states and 4400 transitions. [2024-11-20 00:10:17,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 4400 transitions. [2024-11-20 00:10:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 00:10:17,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:17,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:17,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 00:10:17,740 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:17,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:17,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1305501934, now seen corresponding path program 1 times [2024-11-20 00:10:17,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:17,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328677156] [2024-11-20 00:10:17,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:17,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:17,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:17,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:17,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:10:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:17,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 00:10:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:17,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:10:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:17,944 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-20 00:10:17,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:17,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328677156] [2024-11-20 00:10:17,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328677156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:17,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:17,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:17,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142776489] [2024-11-20 00:10:17,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:17,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:17,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:17,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:17,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:17,946 INFO L87 Difference]: Start difference. First operand 3212 states and 4400 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:19,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:19,997 INFO L93 Difference]: Finished difference Result 5645 states and 8285 transitions. [2024-11-20 00:10:19,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:10:19,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-20 00:10:19,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:20,008 INFO L225 Difference]: With dead ends: 5645 [2024-11-20 00:10:20,009 INFO L226 Difference]: Without dead ends: 3890 [2024-11-20 00:10:20,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:10:20,012 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 1293 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:20,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 1519 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1844 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 00:10:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2024-11-20 00:10:20,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3212. [2024-11-20 00:10:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 2773 states have (on average 1.3743238369996393) internal successors, (3811), 2792 states have internal predecessors, (3811), 252 states have call successors, (252), 155 states have call predecessors, (252), 185 states have return successors, (332), 268 states have call predecessors, (332), 249 states have call successors, (332) [2024-11-20 00:10:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 4395 transitions. [2024-11-20 00:10:20,382 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 4395 transitions. Word has length 168 [2024-11-20 00:10:20,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:20,382 INFO L471 AbstractCegarLoop]: Abstraction has 3212 states and 4395 transitions. [2024-11-20 00:10:20,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:20,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 4395 transitions. [2024-11-20 00:10:20,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 00:10:20,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:20,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:20,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-20 00:10:20,385 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:20,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:20,385 INFO L85 PathProgramCache]: Analyzing trace with hash -894891568, now seen corresponding path program 1 times [2024-11-20 00:10:20,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:20,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130030156] [2024-11-20 00:10:20,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:20,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:20,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:20,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:20,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:10:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:20,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 00:10:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:20,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:10:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:20,614 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-20 00:10:20,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:20,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130030156] [2024-11-20 00:10:20,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130030156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:20,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:20,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:20,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504024662] [2024-11-20 00:10:20,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:20,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:20,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:20,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:20,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:20,617 INFO L87 Difference]: Start difference. First operand 3212 states and 4395 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:24,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:24,076 INFO L93 Difference]: Finished difference Result 7471 states and 11122 transitions. [2024-11-20 00:10:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:10:24,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-20 00:10:24,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:24,095 INFO L225 Difference]: With dead ends: 7471 [2024-11-20 00:10:24,095 INFO L226 Difference]: Without dead ends: 5716 [2024-11-20 00:10:24,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:10:24,102 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 1697 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 3462 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 3561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:24,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1725 Valid, 2761 Invalid, 3561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3462 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-20 00:10:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2024-11-20 00:10:24,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 4602. [2024-11-20 00:10:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4602 states, 4055 states have (on average 1.4241676942046855) internal successors, (5775), 4078 states have internal predecessors, (5775), 332 states have call successors, (332), 179 states have call predecessors, (332), 213 states have return successors, (434), 352 states have call predecessors, (434), 329 states have call successors, (434) [2024-11-20 00:10:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 6541 transitions. [2024-11-20 00:10:24,593 INFO L78 Accepts]: Start accepts. Automaton has 4602 states and 6541 transitions. Word has length 168 [2024-11-20 00:10:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:24,594 INFO L471 AbstractCegarLoop]: Abstraction has 4602 states and 6541 transitions. [2024-11-20 00:10:24,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 4602 states and 6541 transitions. [2024-11-20 00:10:24,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 00:10:24,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:24,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:24,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-20 00:10:24,597 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:24,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:24,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1612205906, now seen corresponding path program 1 times [2024-11-20 00:10:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:24,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357333685] [2024-11-20 00:10:24,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:24,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:10:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 00:10:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:10:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:24,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-20 00:10:24,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:24,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357333685] [2024-11-20 00:10:24,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357333685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:24,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:24,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:24,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022768206] [2024-11-20 00:10:24,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:24,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:24,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:24,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:24,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:24,802 INFO L87 Difference]: Start difference. First operand 4602 states and 6541 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:26,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:26,942 INFO L93 Difference]: Finished difference Result 8877 states and 13328 transitions. [2024-11-20 00:10:26,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:10:26,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-20 00:10:26,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:26,957 INFO L225 Difference]: With dead ends: 8877 [2024-11-20 00:10:26,957 INFO L226 Difference]: Without dead ends: 5732 [2024-11-20 00:10:26,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:10:26,963 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 1292 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:26,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 1519 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1818 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 00:10:26,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5732 states. [2024-11-20 00:10:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5732 to 4602. [2024-11-20 00:10:27,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4602 states, 4055 states have (on average 1.4219482120838471) internal successors, (5766), 4078 states have internal predecessors, (5766), 332 states have call successors, (332), 179 states have call predecessors, (332), 213 states have return successors, (434), 352 states have call predecessors, (434), 329 states have call successors, (434) [2024-11-20 00:10:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 6532 transitions. [2024-11-20 00:10:27,400 INFO L78 Accepts]: Start accepts. Automaton has 4602 states and 6532 transitions. Word has length 168 [2024-11-20 00:10:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:27,400 INFO L471 AbstractCegarLoop]: Abstraction has 4602 states and 6532 transitions. [2024-11-20 00:10:27,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:10:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4602 states and 6532 transitions. [2024-11-20 00:10:27,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 00:10:27,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:27,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:27,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-20 00:10:27,402 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:27,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:27,403 INFO L85 PathProgramCache]: Analyzing trace with hash -523677296, now seen corresponding path program 1 times [2024-11-20 00:10:27,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:27,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947382031] [2024-11-20 00:10:27,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:27,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:27,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:27,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:27,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 00:10:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:27,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 00:10:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:27,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:10:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:27,622 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-20 00:10:27,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:27,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947382031] [2024-11-20 00:10:27,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947382031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:27,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:27,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:27,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233737005] [2024-11-20 00:10:27,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:27,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:27,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:27,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:27,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:27,625 INFO L87 Difference]: Start difference. First operand 4602 states and 6532 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)