./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_1.cil-2+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_1.cil-2+token_ring.07.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 686ecb1010b71c794fc4e873862aa984c2fdfbe32a68bd8271c0851d6420f945 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 02:59:46,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 02:59:46,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 02:59:46,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 02:59:46,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 02:59:46,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 02:59:46,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 02:59:46,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 02:59:46,458 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 02:59:46,458 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 02:59:46,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 02:59:46,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 02:59:46,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 02:59:46,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 02:59:46,460 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 02:59:46,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 02:59:46,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 02:59:46,461 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 02:59:46,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 02:59:46,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 02:59:46,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 02:59:46,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 02:59:46,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 02:59:46,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 02:59:46,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 02:59:46,466 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 02:59:46,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 02:59:46,466 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 02:59:46,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 02:59:46,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 02:59:46,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 02:59:46,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 02:59:46,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:59:46,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 02:59:46,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 02:59:46,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 02:59:46,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 02:59:46,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 02:59:46,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 02:59:46,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 02:59:46,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 02:59:46,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 02:59:46,472 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 -> 686ecb1010b71c794fc4e873862aa984c2fdfbe32a68bd8271c0851d6420f945 [2024-10-24 02:59:46,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 02:59:46,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 02:59:46,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 02:59:46,751 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 02:59:46,752 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 02:59:46,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.07.cil-1.c [2024-10-24 02:59:48,197 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 02:59:48,434 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 02:59:48,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.07.cil-1.c [2024-10-24 02:59:48,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af371f15c/2fe13e76cea04feca7b743f966c9ad6f/FLAG2699b20c4 [2024-10-24 02:59:48,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af371f15c/2fe13e76cea04feca7b743f966c9ad6f [2024-10-24 02:59:48,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 02:59:48,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 02:59:48,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 02:59:48,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 02:59:48,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 02:59:48,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:59:48" (1/1) ... [2024-10-24 02:59:48,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ade7d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:48, skipping insertion in model container [2024-10-24 02:59:48,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:59:48" (1/1) ... [2024-10-24 02:59:48,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 02:59:49,020 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.07.cil-1.c[913,926] [2024-10-24 02:59:49,060 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.07.cil-1.c[5977,5990] [2024-10-24 02:59:49,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:59:49,163 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 02:59:49,174 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.07.cil-1.c[913,926] [2024-10-24 02:59:49,194 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.07.cil-1.c[5977,5990] [2024-10-24 02:59:49,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:59:49,312 INFO L204 MainTranslator]: Completed translation [2024-10-24 02:59:49,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:49 WrapperNode [2024-10-24 02:59:49,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 02:59:49,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 02:59:49,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 02:59:49,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 02:59:49,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:49" (1/1) ... [2024-10-24 02:59:49,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:49" (1/1) ... [2024-10-24 02:59:49,420 INFO L138 Inliner]: procedures = 62, calls = 69, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 783 [2024-10-24 02:59:49,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 02:59:49,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 02:59:49,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 02:59:49,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 02:59:49,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:49" (1/1) ... [2024-10-24 02:59:49,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:49" (1/1) ... [2024-10-24 02:59:49,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:49" (1/1) ... [2024-10-24 02:59:49,465 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 02:59:49,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:49" (1/1) ... [2024-10-24 02:59:49,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:49" (1/1) ... [2024-10-24 02:59:49,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:49" (1/1) ... [2024-10-24 02:59:49,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:49" (1/1) ... [2024-10-24 02:59:49,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:49" (1/1) ... [2024-10-24 02:59:49,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:49" (1/1) ... [2024-10-24 02:59:49,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 02:59:49,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 02:59:49,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 02:59:49,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 02:59:49,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:49" (1/1) ... [2024-10-24 02:59:49,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:59:49,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:59:49,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 02:59:49,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 02:59:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 02:59:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-24 02:59:49,616 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-24 02:59:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-24 02:59:49,618 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-24 02:59:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-24 02:59:49,618 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-24 02:59:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-24 02:59:49,619 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-24 02:59:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-24 02:59:49,619 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-24 02:59:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-24 02:59:49,619 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-24 02:59:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-24 02:59:49,619 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-24 02:59:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 02:59:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-24 02:59:49,619 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-24 02:59:49,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 02:59:49,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 02:59:49,620 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-24 02:59:49,620 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-24 02:59:49,768 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 02:59:49,771 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 02:59:50,590 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2024-10-24 02:59:50,590 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 02:59:50,669 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 02:59:50,670 INFO L314 CfgBuilder]: Removed 14 assume(true) statements. [2024-10-24 02:59:50,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:59:50 BoogieIcfgContainer [2024-10-24 02:59:50,670 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 02:59:50,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 02:59:50,676 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 02:59:50,679 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 02:59:50,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:59:48" (1/3) ... [2024-10-24 02:59:50,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408115df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:59:50, skipping insertion in model container [2024-10-24 02:59:50,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:49" (2/3) ... [2024-10-24 02:59:50,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408115df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:59:50, skipping insertion in model container [2024-10-24 02:59:50,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:59:50" (3/3) ... [2024-10-24 02:59:50,683 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.07.cil-1.c [2024-10-24 02:59:50,698 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 02:59:50,698 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 02:59:50,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 02:59:50,774 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;@309ee7b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 02:59:50,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 02:59:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 296 states, 257 states have (on average 1.7042801556420233) internal successors, (438), 262 states have internal predecessors, (438), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 02:59:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-24 02:59:50,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:50,791 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] [2024-10-24 02:59:50,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:50,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:50,798 INFO L85 PathProgramCache]: Analyzing trace with hash 357628014, now seen corresponding path program 1 times [2024-10-24 02:59:50,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:50,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78300859] [2024-10-24 02:59:50,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:50,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:51,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 02:59:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:51,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:59:51,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:51,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78300859] [2024-10-24 02:59:51,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78300859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:51,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:59:51,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 02:59:51,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230804745] [2024-10-24 02:59:51,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:51,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:59:51,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:51,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:59:51,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 02:59:51,245 INFO L87 Difference]: Start difference. First operand has 296 states, 257 states have (on average 1.7042801556420233) internal successors, (438), 262 states have internal predecessors, (438), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 02:59:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:51,852 INFO L93 Difference]: Finished difference Result 638 states and 1058 transitions. [2024-10-24 02:59:51,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:59:51,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-10-24 02:59:51,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:51,869 INFO L225 Difference]: With dead ends: 638 [2024-10-24 02:59:51,869 INFO L226 Difference]: Without dead ends: 354 [2024-10-24 02:59:51,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:51,878 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 601 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:51,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 532 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 02:59:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-24 02:59:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 348. [2024-10-24 02:59:51,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 304 states have (on average 1.555921052631579) internal successors, (473), 308 states have internal predecessors, (473), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (35), 29 states have call predecessors, (35), 29 states have call successors, (35) [2024-10-24 02:59:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 539 transitions. [2024-10-24 02:59:51,957 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 539 transitions. Word has length 37 [2024-10-24 02:59:51,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:51,958 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 539 transitions. [2024-10-24 02:59:51,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 02:59:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 539 transitions. [2024-10-24 02:59:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 02:59:51,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:51,963 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] [2024-10-24 02:59:51,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 02:59:51,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:51,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:51,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1987468010, now seen corresponding path program 1 times [2024-10-24 02:59:51,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:51,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496394011] [2024-10-24 02:59:51,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:51,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:52,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:52,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:59:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:59:52,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:52,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496394011] [2024-10-24 02:59:52,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496394011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:52,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:59:52,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 02:59:52,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205582362] [2024-10-24 02:59:52,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:52,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:59:52,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:52,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:59:52,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 02:59:52,080 INFO L87 Difference]: Start difference. First operand 348 states and 539 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 02:59:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:52,554 INFO L93 Difference]: Finished difference Result 582 states and 883 transitions. [2024-10-24 02:59:52,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:59:52,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-24 02:59:52,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:52,563 INFO L225 Difference]: With dead ends: 582 [2024-10-24 02:59:52,564 INFO L226 Difference]: Without dead ends: 471 [2024-10-24 02:59:52,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:52,570 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 614 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:52,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 527 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 02:59:52,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-10-24 02:59:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 448. [2024-10-24 02:59:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 391 states have (on average 1.5115089514066495) internal successors, (591), 396 states have internal predecessors, (591), 39 states have call successors, (39), 15 states have call predecessors, (39), 16 states have return successors, (49), 37 states have call predecessors, (49), 37 states have call successors, (49) [2024-10-24 02:59:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 679 transitions. [2024-10-24 02:59:52,644 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 679 transitions. Word has length 38 [2024-10-24 02:59:52,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:52,645 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 679 transitions. [2024-10-24 02:59:52,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 02:59:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 679 transitions. [2024-10-24 02:59:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 02:59:52,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:52,651 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] [2024-10-24 02:59:52,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 02:59:52,652 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:52,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:52,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1836337236, now seen corresponding path program 1 times [2024-10-24 02:59:52,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:52,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234453847] [2024-10-24 02:59:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:52,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:52,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 02:59:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:59:52,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:52,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234453847] [2024-10-24 02:59:52,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234453847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:52,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:59:52,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 02:59:52,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523508419] [2024-10-24 02:59:52,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:52,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:59:52,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:52,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:59:52,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 02:59:52,812 INFO L87 Difference]: Start difference. First operand 448 states and 679 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 02:59:53,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:53,367 INFO L93 Difference]: Finished difference Result 868 states and 1260 transitions. [2024-10-24 02:59:53,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:59:53,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-24 02:59:53,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:53,372 INFO L225 Difference]: With dead ends: 868 [2024-10-24 02:59:53,373 INFO L226 Difference]: Without dead ends: 657 [2024-10-24 02:59:53,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:53,375 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 251 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:53,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 732 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 02:59:53,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-10-24 02:59:53,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 553. [2024-10-24 02:59:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 484 states have (on average 1.487603305785124) internal successors, (720), 491 states have internal predecessors, (720), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (55), 41 states have call predecessors, (55), 43 states have call successors, (55) [2024-10-24 02:59:53,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 820 transitions. [2024-10-24 02:59:53,421 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 820 transitions. Word has length 39 [2024-10-24 02:59:53,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:53,421 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 820 transitions. [2024-10-24 02:59:53,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 02:59:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 820 transitions. [2024-10-24 02:59:53,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 02:59:53,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:53,425 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:59:53,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 02:59:53,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:53,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:53,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1734053101, now seen corresponding path program 1 times [2024-10-24 02:59:53,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:53,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391337620] [2024-10-24 02:59:53,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:53,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:53,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:53,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 02:59:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:53,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:59:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 02:59:53,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:53,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391337620] [2024-10-24 02:59:53,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391337620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:53,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:59:53,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 02:59:53,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446959908] [2024-10-24 02:59:53,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:53,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:59:53,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:53,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:59:53,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 02:59:53,557 INFO L87 Difference]: Start difference. First operand 553 states and 820 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 02:59:54,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:54,059 INFO L93 Difference]: Finished difference Result 1069 states and 1537 transitions. [2024-10-24 02:59:54,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:59:54,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2024-10-24 02:59:54,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:54,064 INFO L225 Difference]: With dead ends: 1069 [2024-10-24 02:59:54,064 INFO L226 Difference]: Without dead ends: 753 [2024-10-24 02:59:54,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:54,067 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 236 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:54,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 779 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 02:59:54,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-10-24 02:59:54,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 719. [2024-10-24 02:59:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 626 states have (on average 1.4313099041533546) internal successors, (896), 635 states have internal predecessors, (896), 59 states have call successors, (59), 29 states have call predecessors, (59), 32 states have return successors, (79), 55 states have call predecessors, (79), 57 states have call successors, (79) [2024-10-24 02:59:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1034 transitions. [2024-10-24 02:59:54,130 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1034 transitions. Word has length 54 [2024-10-24 02:59:54,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:54,132 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 1034 transitions. [2024-10-24 02:59:54,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 02:59:54,133 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1034 transitions. [2024-10-24 02:59:54,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 02:59:54,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:54,135 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 02:59:54,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 02:59:54,136 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:54,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:54,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1757423978, now seen corresponding path program 1 times [2024-10-24 02:59:54,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:54,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123123378] [2024-10-24 02:59:54,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 02:59:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 02:59:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 02:59:54,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:54,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123123378] [2024-10-24 02:59:54,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123123378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:54,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:59:54,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 02:59:54,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108394755] [2024-10-24 02:59:54,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:54,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:59:54,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:54,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:59:54,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 02:59:54,214 INFO L87 Difference]: Start difference. First operand 719 states and 1034 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 02:59:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:54,617 INFO L93 Difference]: Finished difference Result 1298 states and 1813 transitions. [2024-10-24 02:59:54,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:59:54,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-24 02:59:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:54,626 INFO L225 Difference]: With dead ends: 1298 [2024-10-24 02:59:54,626 INFO L226 Difference]: Without dead ends: 896 [2024-10-24 02:59:54,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:54,630 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 600 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:54,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 539 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 02:59:54,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-10-24 02:59:54,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 847. [2024-10-24 02:59:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 738 states have (on average 1.397018970189702) internal successors, (1031), 749 states have internal predecessors, (1031), 67 states have call successors, (67), 35 states have call predecessors, (67), 40 states have return successors, (93), 63 states have call predecessors, (93), 65 states have call successors, (93) [2024-10-24 02:59:54,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1191 transitions. [2024-10-24 02:59:54,678 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1191 transitions. Word has length 59 [2024-10-24 02:59:54,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:54,678 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1191 transitions. [2024-10-24 02:59:54,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 02:59:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1191 transitions. [2024-10-24 02:59:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 02:59:54,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:54,681 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 02:59:54,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 02:59:54,681 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:54,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:54,682 INFO L85 PathProgramCache]: Analyzing trace with hash 860035620, now seen corresponding path program 1 times [2024-10-24 02:59:54,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:54,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208517796] [2024-10-24 02:59:54,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:54,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 02:59:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:59:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 02:59:54,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:54,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208517796] [2024-10-24 02:59:54,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208517796] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:59:54,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576657451] [2024-10-24 02:59:54,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:54,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:59:54,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:59:54,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:59:54,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 02:59:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:54,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 02:59:54,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:59:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 02:59:54,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:59:54,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576657451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:54,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:59:54,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-24 02:59:54,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747960314] [2024-10-24 02:59:54,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:54,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:59:54,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:54,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:59:54,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:54,940 INFO L87 Difference]: Start difference. First operand 847 states and 1191 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 02:59:55,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:55,056 INFO L93 Difference]: Finished difference Result 1335 states and 1865 transitions. [2024-10-24 02:59:55,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 02:59:55,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-24 02:59:55,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:55,062 INFO L225 Difference]: With dead ends: 1335 [2024-10-24 02:59:55,062 INFO L226 Difference]: Without dead ends: 852 [2024-10-24 02:59:55,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:55,065 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 0 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:55,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1249 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 02:59:55,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2024-10-24 02:59:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2024-10-24 02:59:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 743 states have (on average 1.3835800807537013) internal successors, (1028), 754 states have internal predecessors, (1028), 67 states have call successors, (67), 35 states have call predecessors, (67), 40 states have return successors, (93), 63 states have call predecessors, (93), 65 states have call successors, (93) [2024-10-24 02:59:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1188 transitions. [2024-10-24 02:59:55,125 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1188 transitions. Word has length 60 [2024-10-24 02:59:55,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:55,127 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1188 transitions. [2024-10-24 02:59:55,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 02:59:55,127 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1188 transitions. [2024-10-24 02:59:55,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 02:59:55,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:55,129 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 02:59:55,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 02:59:55,329 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,SelfDestructingSolverStorable5 [2024-10-24 02:59:55,330 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:55,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash 16030118, now seen corresponding path program 1 times [2024-10-24 02:59:55,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:55,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079577886] [2024-10-24 02:59:55,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:55,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:55,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 02:59:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:55,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:59:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:55,432 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 02:59:55,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:55,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079577886] [2024-10-24 02:59:55,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079577886] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:59:55,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042186164] [2024-10-24 02:59:55,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:55,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:59:55,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:59:55,435 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:59:55,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 02:59:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:55,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 02:59:55,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:59:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 02:59:55,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:59:55,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042186164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:55,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:59:55,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-24 02:59:55,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761563439] [2024-10-24 02:59:55,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:55,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:59:55,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:55,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:59:55,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:55,549 INFO L87 Difference]: Start difference. First operand 852 states and 1188 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 02:59:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:55,674 INFO L93 Difference]: Finished difference Result 1278 states and 1767 transitions. [2024-10-24 02:59:55,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 02:59:55,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-24 02:59:55,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:55,680 INFO L225 Difference]: With dead ends: 1278 [2024-10-24 02:59:55,680 INFO L226 Difference]: Without dead ends: 749 [2024-10-24 02:59:55,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:55,682 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 0 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:55,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1249 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 02:59:55,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2024-10-24 02:59:55,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 742. [2024-10-24 02:59:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 651 states have (on average 1.390168970814132) internal successors, (905), 660 states have internal predecessors, (905), 57 states have call successors, (57), 29 states have call predecessors, (57), 32 states have return successors, (74), 53 states have call predecessors, (74), 55 states have call successors, (74) [2024-10-24 02:59:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1036 transitions. [2024-10-24 02:59:55,739 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1036 transitions. Word has length 60 [2024-10-24 02:59:55,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:55,746 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1036 transitions. [2024-10-24 02:59:55,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 02:59:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1036 transitions. [2024-10-24 02:59:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 02:59:55,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:55,748 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 02:59:55,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 02:59:55,948 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,SelfDestructingSolverStorable6 [2024-10-24 02:59:55,949 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:55,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:55,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1813669734, now seen corresponding path program 1 times [2024-10-24 02:59:55,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:55,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630407566] [2024-10-24 02:59:55,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:55,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:56,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:56,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 02:59:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:56,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:59:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 02:59:56,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:56,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630407566] [2024-10-24 02:59:56,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630407566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:56,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:59:56,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:59:56,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218210046] [2024-10-24 02:59:56,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:56,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:59:56,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:56,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:59:56,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:56,080 INFO L87 Difference]: Start difference. First operand 742 states and 1036 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 02:59:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:56,525 INFO L93 Difference]: Finished difference Result 827 states and 1139 transitions. [2024-10-24 02:59:56,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 02:59:56,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2024-10-24 02:59:56,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:56,531 INFO L225 Difference]: With dead ends: 827 [2024-10-24 02:59:56,531 INFO L226 Difference]: Without dead ends: 824 [2024-10-24 02:59:56,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 02:59:56,532 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 1016 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:56,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 536 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 02:59:56,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-10-24 02:59:56,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 741. [2024-10-24 02:59:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 651 states have (on average 1.3870967741935485) internal successors, (903), 659 states have internal predecessors, (903), 56 states have call successors, (56), 29 states have call predecessors, (56), 32 states have return successors, (74), 53 states have call predecessors, (74), 55 states have call successors, (74) [2024-10-24 02:59:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1033 transitions. [2024-10-24 02:59:56,601 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1033 transitions. Word has length 60 [2024-10-24 02:59:56,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:56,602 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1033 transitions. [2024-10-24 02:59:56,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 02:59:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1033 transitions. [2024-10-24 02:59:56,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-24 02:59:56,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:56,603 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 02:59:56,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 02:59:56,604 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:56,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:56,604 INFO L85 PathProgramCache]: Analyzing trace with hash 388152939, now seen corresponding path program 1 times [2024-10-24 02:59:56,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:56,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561274751] [2024-10-24 02:59:56,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:56,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:56,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:56,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 02:59:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:56,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:59:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 02:59:56,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:56,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561274751] [2024-10-24 02:59:56,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561274751] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:59:56,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415260107] [2024-10-24 02:59:56,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:56,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:59:56,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:59:56,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:59:56,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 02:59:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:56,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 02:59:56,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:59:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:59:57,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 02:59:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 02:59:57,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415260107] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 02:59:57,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 02:59:57,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-24 02:59:57,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319395778] [2024-10-24 02:59:57,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 02:59:57,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 02:59:57,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:57,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 02:59:57,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 02:59:57,195 INFO L87 Difference]: Start difference. First operand 741 states and 1033 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 02:59:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:58,139 INFO L93 Difference]: Finished difference Result 1544 states and 2068 transitions. [2024-10-24 02:59:58,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 02:59:58,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2024-10-24 02:59:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:58,148 INFO L225 Difference]: With dead ends: 1544 [2024-10-24 02:59:58,148 INFO L226 Difference]: Without dead ends: 1541 [2024-10-24 02:59:58,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-24 02:59:58,149 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 759 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:58,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1573 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 02:59:58,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2024-10-24 02:59:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1044. [2024-10-24 02:59:58,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 918 states have (on average 1.3605664488017428) internal successors, (1249), 932 states have internal predecessors, (1249), 75 states have call successors, (75), 42 states have call predecessors, (75), 49 states have return successors, (104), 70 states have call predecessors, (104), 74 states have call successors, (104) [2024-10-24 02:59:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1428 transitions. [2024-10-24 02:59:58,238 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1428 transitions. Word has length 61 [2024-10-24 02:59:58,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:58,238 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1428 transitions. [2024-10-24 02:59:58,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 02:59:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1428 transitions. [2024-10-24 02:59:58,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 02:59:58,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:58,243 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-24 02:59:58,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 02:59:58,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:59:58,444 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:58,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:58,446 INFO L85 PathProgramCache]: Analyzing trace with hash 853708754, now seen corresponding path program 2 times [2024-10-24 02:59:58,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:58,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23232821] [2024-10-24 02:59:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:58,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:58,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 02:59:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:58,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:59:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:58,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 02:59:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 02:59:58,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:58,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23232821] [2024-10-24 02:59:58,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23232821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:58,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:59:58,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 02:59:58,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030436350] [2024-10-24 02:59:58,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:58,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:59:58,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:58,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:59:58,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 02:59:58,506 INFO L87 Difference]: Start difference. First operand 1044 states and 1428 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 02:59:58,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:58,897 INFO L93 Difference]: Finished difference Result 1672 states and 2245 transitions. [2024-10-24 02:59:58,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:59:58,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2024-10-24 02:59:58,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:58,903 INFO L225 Difference]: With dead ends: 1672 [2024-10-24 02:59:58,903 INFO L226 Difference]: Without dead ends: 1013 [2024-10-24 02:59:58,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:58,905 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 613 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:58,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 555 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 02:59:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2024-10-24 02:59:58,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 936. [2024-10-24 02:59:58,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 823 states have (on average 1.362089914945322) internal successors, (1121), 837 states have internal predecessors, (1121), 68 states have call successors, (68), 37 states have call predecessors, (68), 43 states have return successors, (93), 62 states have call predecessors, (93), 67 states have call successors, (93) [2024-10-24 02:59:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1282 transitions. [2024-10-24 02:59:58,958 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1282 transitions. Word has length 78 [2024-10-24 02:59:58,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:58,958 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1282 transitions. [2024-10-24 02:59:58,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 02:59:58,958 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1282 transitions. [2024-10-24 02:59:58,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 02:59:58,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:58,961 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:59:58,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 02:59:58,961 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:58,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:58,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1703888058, now seen corresponding path program 1 times [2024-10-24 02:59:58,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:58,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339949105] [2024-10-24 02:59:58,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:58,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 02:59:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 02:59:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 02:59:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 02:59:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 02:59:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 02:59:59,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:59,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339949105] [2024-10-24 02:59:59,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339949105] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:59:59,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880508154] [2024-10-24 02:59:59,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:59,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:59:59,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:59:59,091 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-10-24 02:59:59,092 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-10-24 02:59:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 02:59:59,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:59:59,224 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 02:59:59,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 02:59:59,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880508154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:59,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 02:59:59,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-24 02:59:59,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002749433] [2024-10-24 02:59:59,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:59,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:59:59,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:59,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:59:59,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:59:59,227 INFO L87 Difference]: Start difference. First operand 936 states and 1282 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 02:59:59,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:59:59,333 INFO L93 Difference]: Finished difference Result 1219 states and 1638 transitions. [2024-10-24 02:59:59,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:59:59,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2024-10-24 02:59:59,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:59:59,336 INFO L225 Difference]: With dead ends: 1219 [2024-10-24 02:59:59,337 INFO L226 Difference]: Without dead ends: 232 [2024-10-24 02:59:59,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:59:59,339 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 55 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:59:59,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 848 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 02:59:59,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-24 02:59:59,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2024-10-24 02:59:59,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 204 states have (on average 1.607843137254902) internal successors, (328), 205 states have internal predecessors, (328), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 02:59:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 370 transitions. [2024-10-24 02:59:59,352 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 370 transitions. Word has length 92 [2024-10-24 02:59:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:59:59,353 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 370 transitions. [2024-10-24 02:59:59,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 02:59:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 370 transitions. [2024-10-24 02:59:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 02:59:59,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:59:59,354 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] [2024-10-24 02:59:59,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 02:59:59,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:59:59,559 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:59:59,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:59:59,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1910470248, now seen corresponding path program 1 times [2024-10-24 02:59:59,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:59:59,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891493074] [2024-10-24 02:59:59,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:59:59,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:59:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:59:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 02:59:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 02:59:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 02:59:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 02:59:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:59:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:59:59,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:59:59,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891493074] [2024-10-24 02:59:59,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891493074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:59:59,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:59:59,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:59:59,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382090685] [2024-10-24 02:59:59,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:59:59,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:59:59,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:59:59,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:59:59,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:59:59,685 INFO L87 Difference]: Start difference. First operand 232 states and 370 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:00,720 INFO L93 Difference]: Finished difference Result 534 states and 866 transitions. [2024-10-24 03:00:00,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 03:00:00,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-24 03:00:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:00,723 INFO L225 Difference]: With dead ends: 534 [2024-10-24 03:00:00,723 INFO L226 Difference]: Without dead ends: 312 [2024-10-24 03:00:00,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:00:00,724 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 617 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:00,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 417 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 03:00:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-24 03:00:00,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 232. [2024-10-24 03:00:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 204 states have (on average 1.6029411764705883) internal successors, (327), 205 states have internal predecessors, (327), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 03:00:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 369 transitions. [2024-10-24 03:00:00,746 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 369 transitions. Word has length 111 [2024-10-24 03:00:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:00,747 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 369 transitions. [2024-10-24 03:00:00,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 369 transitions. [2024-10-24 03:00:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 03:00:00,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:00,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] [2024-10-24 03:00:00,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 03:00:00,748 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:00,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:00,749 INFO L85 PathProgramCache]: Analyzing trace with hash 487000282, now seen corresponding path program 1 times [2024-10-24 03:00:00,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:00,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297552515] [2024-10-24 03:00:00,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:00,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:00,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:00,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:00:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:00,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 03:00:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:00,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 03:00:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:00,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 03:00:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:00,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:00,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297552515] [2024-10-24 03:00:00,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297552515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:00,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:00,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:00:00,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342963448] [2024-10-24 03:00:00,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:00,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:00:00,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:00,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:00:00,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:00:00,916 INFO L87 Difference]: Start difference. First operand 232 states and 369 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:02,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:02,626 INFO L93 Difference]: Finished difference Result 837 states and 1365 transitions. [2024-10-24 03:00:02,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 03:00:02,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-24 03:00:02,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:02,632 INFO L225 Difference]: With dead ends: 837 [2024-10-24 03:00:02,632 INFO L226 Difference]: Without dead ends: 619 [2024-10-24 03:00:02,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:00:02,634 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 932 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:02,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 701 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 03:00:02,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-10-24 03:00:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 460. [2024-10-24 03:00:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 409 states have (on average 1.6136919315403424) internal successors, (660), 411 states have internal predecessors, (660), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2024-10-24 03:00:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 737 transitions. [2024-10-24 03:00:02,673 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 737 transitions. Word has length 111 [2024-10-24 03:00:02,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:02,673 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 737 transitions. [2024-10-24 03:00:02,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 737 transitions. [2024-10-24 03:00:02,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 03:00:02,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:02,677 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] [2024-10-24 03:00:02,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 03:00:02,677 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:02,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:02,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1765998942, now seen corresponding path program 1 times [2024-10-24 03:00:02,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:02,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128199952] [2024-10-24 03:00:02,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:02,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:02,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:02,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:00:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:02,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 03:00:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:02,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 03:00:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:02,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 03:00:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:02,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:02,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128199952] [2024-10-24 03:00:02,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128199952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:02,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:02,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:02,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457790273] [2024-10-24 03:00:02,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:02,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:02,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:02,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:02,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:02,957 INFO L87 Difference]: Start difference. First operand 460 states and 737 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:05,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:05,170 INFO L93 Difference]: Finished difference Result 1382 states and 2251 transitions. [2024-10-24 03:00:05,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 03:00:05,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-24 03:00:05,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:05,176 INFO L225 Difference]: With dead ends: 1382 [2024-10-24 03:00:05,177 INFO L226 Difference]: Without dead ends: 936 [2024-10-24 03:00:05,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 03:00:05,179 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 957 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 2366 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 2417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:05,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 1321 Invalid, 2417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2366 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 03:00:05,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2024-10-24 03:00:05,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 671. [2024-10-24 03:00:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 597 states have (on average 1.6063651591289783) internal successors, (959), 600 states have internal predecessors, (959), 53 states have call successors, (53), 18 states have call predecessors, (53), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-24 03:00:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1070 transitions. [2024-10-24 03:00:05,235 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1070 transitions. Word has length 111 [2024-10-24 03:00:05,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:05,236 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 1070 transitions. [2024-10-24 03:00:05,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:05,236 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1070 transitions. [2024-10-24 03:00:05,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 03:00:05,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:05,238 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] [2024-10-24 03:00:05,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 03:00:05,238 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:05,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:05,239 INFO L85 PathProgramCache]: Analyzing trace with hash 147024028, now seen corresponding path program 1 times [2024-10-24 03:00:05,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:05,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375005895] [2024-10-24 03:00:05,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:05,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:05,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:05,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:00:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:05,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 03:00:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:05,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 03:00:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:05,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 03:00:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:05,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:05,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375005895] [2024-10-24 03:00:05,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375005895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:05,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:05,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:05,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224484058] [2024-10-24 03:00:05,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:05,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:05,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:05,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:05,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:05,432 INFO L87 Difference]: Start difference. First operand 671 states and 1070 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:06,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:06,476 INFO L93 Difference]: Finished difference Result 1601 states and 2606 transitions. [2024-10-24 03:00:06,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:00:06,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-24 03:00:06,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:06,481 INFO L225 Difference]: With dead ends: 1601 [2024-10-24 03:00:06,482 INFO L226 Difference]: Without dead ends: 944 [2024-10-24 03:00:06,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:00:06,486 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 788 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:06,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 565 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 03:00:06,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-10-24 03:00:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 671. [2024-10-24 03:00:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 597 states have (on average 1.6013400335008374) internal successors, (956), 600 states have internal predecessors, (956), 53 states have call successors, (53), 18 states have call predecessors, (53), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-24 03:00:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1067 transitions. [2024-10-24 03:00:06,542 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1067 transitions. Word has length 111 [2024-10-24 03:00:06,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:06,542 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 1067 transitions. [2024-10-24 03:00:06,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1067 transitions. [2024-10-24 03:00:06,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 03:00:06,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:06,544 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] [2024-10-24 03:00:06,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 03:00:06,544 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:06,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:06,545 INFO L85 PathProgramCache]: Analyzing trace with hash 118523738, now seen corresponding path program 1 times [2024-10-24 03:00:06,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:06,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80597093] [2024-10-24 03:00:06,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:06,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:06,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:06,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:00:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:06,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 03:00:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:06,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 03:00:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:06,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 03:00:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:06,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:06,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80597093] [2024-10-24 03:00:06,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80597093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:06,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:06,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:06,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43435354] [2024-10-24 03:00:06,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:06,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:06,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:06,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:06,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:06,744 INFO L87 Difference]: Start difference. First operand 671 states and 1067 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:07,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:07,811 INFO L93 Difference]: Finished difference Result 1597 states and 2589 transitions. [2024-10-24 03:00:07,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:00:07,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-24 03:00:07,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:07,817 INFO L225 Difference]: With dead ends: 1597 [2024-10-24 03:00:07,817 INFO L226 Difference]: Without dead ends: 940 [2024-10-24 03:00:07,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:00:07,819 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 689 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:07,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 673 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 03:00:07,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2024-10-24 03:00:07,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 671. [2024-10-24 03:00:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 597 states have (on average 1.5963149078726968) internal successors, (953), 600 states have internal predecessors, (953), 53 states have call successors, (53), 18 states have call predecessors, (53), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-24 03:00:07,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1064 transitions. [2024-10-24 03:00:07,871 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1064 transitions. Word has length 111 [2024-10-24 03:00:07,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:07,871 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 1064 transitions. [2024-10-24 03:00:07,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:07,872 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1064 transitions. [2024-10-24 03:00:07,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 03:00:07,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:07,873 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] [2024-10-24 03:00:07,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 03:00:07,873 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:07,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:07,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1822058276, now seen corresponding path program 1 times [2024-10-24 03:00:07,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:07,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170344651] [2024-10-24 03:00:07,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:07,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:07,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:07,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:00:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:08,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 03:00:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:08,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 03:00:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:08,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 03:00:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:08,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:08,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170344651] [2024-10-24 03:00:08,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170344651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:08,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:08,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:08,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559157494] [2024-10-24 03:00:08,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:08,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:08,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:08,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:08,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:08,096 INFO L87 Difference]: Start difference. First operand 671 states and 1064 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:09,132 INFO L93 Difference]: Finished difference Result 1593 states and 2572 transitions. [2024-10-24 03:00:09,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:00:09,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-24 03:00:09,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:09,139 INFO L225 Difference]: With dead ends: 1593 [2024-10-24 03:00:09,139 INFO L226 Difference]: Without dead ends: 936 [2024-10-24 03:00:09,142 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-10-24 03:00:09,142 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 784 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:09,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 565 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 03:00:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2024-10-24 03:00:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 671. [2024-10-24 03:00:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 597 states have (on average 1.5912897822445562) internal successors, (950), 600 states have internal predecessors, (950), 53 states have call successors, (53), 18 states have call predecessors, (53), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-24 03:00:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1061 transitions. [2024-10-24 03:00:09,201 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1061 transitions. Word has length 111 [2024-10-24 03:00:09,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:09,201 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 1061 transitions. [2024-10-24 03:00:09,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:09,202 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1061 transitions. [2024-10-24 03:00:09,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 03:00:09,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:09,203 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] [2024-10-24 03:00:09,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 03:00:09,203 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:09,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:09,204 INFO L85 PathProgramCache]: Analyzing trace with hash 55004954, now seen corresponding path program 1 times [2024-10-24 03:00:09,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:09,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836154331] [2024-10-24 03:00:09,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:09,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:09,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:09,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:00:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:09,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 03:00:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:09,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 03:00:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:09,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 03:00:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:09,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:09,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836154331] [2024-10-24 03:00:09,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836154331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:09,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:09,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:09,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968689076] [2024-10-24 03:00:09,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:09,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:09,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:09,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:09,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:09,436 INFO L87 Difference]: Start difference. First operand 671 states and 1061 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:11,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:11,509 INFO L93 Difference]: Finished difference Result 2167 states and 3476 transitions. [2024-10-24 03:00:11,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 03:00:11,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-24 03:00:11,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:11,516 INFO L225 Difference]: With dead ends: 2167 [2024-10-24 03:00:11,517 INFO L226 Difference]: Without dead ends: 1510 [2024-10-24 03:00:11,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 03:00:11,520 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 930 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:11,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 1319 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2270 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 03:00:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-10-24 03:00:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1106. [2024-10-24 03:00:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 986 states have (on average 1.5831643002028397) internal successors, (1561), 991 states have internal predecessors, (1561), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-24 03:00:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1744 transitions. [2024-10-24 03:00:11,607 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1744 transitions. Word has length 111 [2024-10-24 03:00:11,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:11,608 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1744 transitions. [2024-10-24 03:00:11,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1744 transitions. [2024-10-24 03:00:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 03:00:11,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:11,609 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] [2024-10-24 03:00:11,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 03:00:11,610 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:11,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:11,610 INFO L85 PathProgramCache]: Analyzing trace with hash -715728612, now seen corresponding path program 1 times [2024-10-24 03:00:11,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:11,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002172477] [2024-10-24 03:00:11,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:11,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:11,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:11,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:00:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:11,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 03:00:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:11,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 03:00:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 03:00:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:11,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:11,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002172477] [2024-10-24 03:00:11,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002172477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:11,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:11,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:11,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300294699] [2024-10-24 03:00:11,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:11,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:11,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:11,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:11,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:11,793 INFO L87 Difference]: Start difference. First operand 1106 states and 1744 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:12,891 INFO L93 Difference]: Finished difference Result 2589 states and 4147 transitions. [2024-10-24 03:00:12,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:00:12,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-24 03:00:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:12,900 INFO L225 Difference]: With dead ends: 2589 [2024-10-24 03:00:12,900 INFO L226 Difference]: Without dead ends: 1497 [2024-10-24 03:00:12,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:00:12,904 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 720 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:12,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 672 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 03:00:12,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2024-10-24 03:00:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1106. [2024-10-24 03:00:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 986 states have (on average 1.5780933062880325) internal successors, (1556), 991 states have internal predecessors, (1556), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-24 03:00:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1739 transitions. [2024-10-24 03:00:13,004 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1739 transitions. Word has length 111 [2024-10-24 03:00:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:13,004 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1739 transitions. [2024-10-24 03:00:13,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1739 transitions. [2024-10-24 03:00:13,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 03:00:13,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:13,007 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] [2024-10-24 03:00:13,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 03:00:13,007 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:13,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:13,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1710422310, now seen corresponding path program 1 times [2024-10-24 03:00:13,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:13,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097434287] [2024-10-24 03:00:13,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:13,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:13,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:13,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:00:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:13,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 03:00:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:13,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 03:00:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:13,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 03:00:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:13,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:13,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097434287] [2024-10-24 03:00:13,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097434287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:13,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:13,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:13,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684967504] [2024-10-24 03:00:13,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:13,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:13,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:13,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:13,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:13,200 INFO L87 Difference]: Start difference. First operand 1106 states and 1739 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:15,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:15,585 INFO L93 Difference]: Finished difference Result 4068 states and 6477 transitions. [2024-10-24 03:00:15,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 03:00:15,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-24 03:00:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:15,601 INFO L225 Difference]: With dead ends: 4068 [2024-10-24 03:00:15,602 INFO L226 Difference]: Without dead ends: 2976 [2024-10-24 03:00:15,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:00:15,607 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 1181 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:15,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 1312 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 03:00:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2024-10-24 03:00:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1968. [2024-10-24 03:00:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1760 states have (on average 1.5704545454545455) internal successors, (2764), 1769 states have internal predecessors, (2764), 145 states have call successors, (145), 54 states have call predecessors, (145), 62 states have return successors, (180), 152 states have call predecessors, (180), 145 states have call successors, (180) [2024-10-24 03:00:15,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 3089 transitions. [2024-10-24 03:00:15,860 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 3089 transitions. Word has length 111 [2024-10-24 03:00:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:15,861 INFO L471 AbstractCegarLoop]: Abstraction has 1968 states and 3089 transitions. [2024-10-24 03:00:15,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:15,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 3089 transitions. [2024-10-24 03:00:15,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 03:00:15,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:15,864 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] [2024-10-24 03:00:15,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 03:00:15,864 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:15,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:15,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1998268764, now seen corresponding path program 1 times [2024-10-24 03:00:15,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:15,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525188790] [2024-10-24 03:00:15,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:15,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:15,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:16,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:00:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:16,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 03:00:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:16,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 03:00:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:16,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 03:00:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:16,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:16,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525188790] [2024-10-24 03:00:16,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525188790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:16,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:16,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:16,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156385716] [2024-10-24 03:00:16,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:16,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:16,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:16,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:16,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:16,103 INFO L87 Difference]: Start difference. First operand 1968 states and 3089 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:18,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:18,811 INFO L93 Difference]: Finished difference Result 7396 states and 11761 transitions. [2024-10-24 03:00:18,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 03:00:18,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-24 03:00:18,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:18,870 INFO L225 Difference]: With dead ends: 7396 [2024-10-24 03:00:18,870 INFO L226 Difference]: Without dead ends: 5442 [2024-10-24 03:00:18,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:00:18,882 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 982 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 2600 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 2655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:18,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1308 Invalid, 2655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2600 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 03:00:18,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5442 states. [2024-10-24 03:00:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5442 to 3649. [2024-10-24 03:00:19,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3649 states, 3269 states have (on average 1.5656163964515142) internal successors, (5118), 3286 states have internal predecessors, (5118), 261 states have call successors, (261), 102 states have call predecessors, (261), 118 states have return successors, (358), 276 states have call predecessors, (358), 261 states have call successors, (358) [2024-10-24 03:00:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 5737 transitions. [2024-10-24 03:00:19,225 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 5737 transitions. Word has length 111 [2024-10-24 03:00:19,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:19,225 INFO L471 AbstractCegarLoop]: Abstraction has 3649 states and 5737 transitions. [2024-10-24 03:00:19,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:19,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 5737 transitions. [2024-10-24 03:00:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 03:00:19,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:19,229 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] [2024-10-24 03:00:19,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 03:00:19,229 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:19,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:19,230 INFO L85 PathProgramCache]: Analyzing trace with hash 39693978, now seen corresponding path program 1 times [2024-10-24 03:00:19,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:19,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939920045] [2024-10-24 03:00:19,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:19,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:19,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:19,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:00:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:19,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 03:00:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:19,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 03:00:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:19,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 03:00:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:19,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:19,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939920045] [2024-10-24 03:00:19,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939920045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:19,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:19,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:19,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825029318] [2024-10-24 03:00:19,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:19,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:19,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:19,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:19,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:19,452 INFO L87 Difference]: Start difference. First operand 3649 states and 5737 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:22,159 INFO L93 Difference]: Finished difference Result 13609 states and 21675 transitions. [2024-10-24 03:00:22,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 03:00:22,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-24 03:00:22,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:22,200 INFO L225 Difference]: With dead ends: 13609 [2024-10-24 03:00:22,200 INFO L226 Difference]: Without dead ends: 9974 [2024-10-24 03:00:22,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:00:22,216 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 960 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 2482 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:22,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 1312 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2482 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 03:00:22,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9974 states. [2024-10-24 03:00:22,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9974 to 7067. [2024-10-24 03:00:22,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7067 states, 6351 states have (on average 1.564792945992757) internal successors, (9938), 6384 states have internal predecessors, (9938), 485 states have call successors, (485), 198 states have call predecessors, (485), 230 states have return successors, (760), 516 states have call predecessors, (760), 485 states have call successors, (760) [2024-10-24 03:00:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 11183 transitions. [2024-10-24 03:00:23,004 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 11183 transitions. Word has length 111 [2024-10-24 03:00:23,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:23,005 INFO L471 AbstractCegarLoop]: Abstraction has 7067 states and 11183 transitions. [2024-10-24 03:00:23,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 11183 transitions. [2024-10-24 03:00:23,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 03:00:23,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:23,012 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] [2024-10-24 03:00:23,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 03:00:23,012 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:23,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:23,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1839436968, now seen corresponding path program 1 times [2024-10-24 03:00:23,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:23,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039355816] [2024-10-24 03:00:23,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:23,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:23,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:23,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:00:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:23,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 03:00:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:23,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 03:00:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:23,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 03:00:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:23,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:23,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039355816] [2024-10-24 03:00:23,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039355816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:23,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:23,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:23,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490579844] [2024-10-24 03:00:23,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:23,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:23,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:23,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:23,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:23,185 INFO L87 Difference]: Start difference. First operand 7067 states and 11183 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:26,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:26,353 INFO L93 Difference]: Finished difference Result 26129 states and 41843 transitions. [2024-10-24 03:00:26,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 03:00:26,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-24 03:00:26,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:26,432 INFO L225 Difference]: With dead ends: 26129 [2024-10-24 03:00:26,433 INFO L226 Difference]: Without dead ends: 19076 [2024-10-24 03:00:26,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:00:26,462 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 1040 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 2164 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:26,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 1312 Invalid, 2220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2164 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 03:00:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19076 states. [2024-10-24 03:00:28,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19076 to 13900. [2024-10-24 03:00:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13900 states, 12528 states have (on average 1.5648148148148149) internal successors, (19604), 12593 states have internal predecessors, (19604), 917 states have call successors, (917), 390 states have call predecessors, (917), 454 states have return successors, (1710), 980 states have call predecessors, (1710), 917 states have call successors, (1710) [2024-10-24 03:00:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13900 states to 13900 states and 22231 transitions. [2024-10-24 03:00:28,242 INFO L78 Accepts]: Start accepts. Automaton has 13900 states and 22231 transitions. Word has length 111 [2024-10-24 03:00:28,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:28,243 INFO L471 AbstractCegarLoop]: Abstraction has 13900 states and 22231 transitions. [2024-10-24 03:00:28,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:28,243 INFO L276 IsEmpty]: Start isEmpty. Operand 13900 states and 22231 transitions. [2024-10-24 03:00:28,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 03:00:28,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:28,256 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] [2024-10-24 03:00:28,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 03:00:28,256 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:28,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:28,257 INFO L85 PathProgramCache]: Analyzing trace with hash -514580774, now seen corresponding path program 1 times [2024-10-24 03:00:28,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:28,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288880711] [2024-10-24 03:00:28,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:28,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:28,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:28,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:00:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:28,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 03:00:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:28,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 03:00:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:28,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 03:00:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:28,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:28,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288880711] [2024-10-24 03:00:28,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288880711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:28,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:28,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:28,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570326452] [2024-10-24 03:00:28,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:28,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:28,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:28,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:28,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:28,434 INFO L87 Difference]: Start difference. First operand 13900 states and 22231 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:30,860 INFO L93 Difference]: Finished difference Result 31497 states and 51148 transitions. [2024-10-24 03:00:30,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:00:30,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-24 03:00:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:30,936 INFO L225 Difference]: With dead ends: 31497 [2024-10-24 03:00:30,936 INFO L226 Difference]: Without dead ends: 17611 [2024-10-24 03:00:30,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:00:30,980 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 690 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:30,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 672 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 03:00:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17611 states. [2024-10-24 03:00:32,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17611 to 13900. [2024-10-24 03:00:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13900 states, 12528 states have (on average 1.5596264367816093) internal successors, (19539), 12593 states have internal predecessors, (19539), 917 states have call successors, (917), 390 states have call predecessors, (917), 454 states have return successors, (1710), 980 states have call predecessors, (1710), 917 states have call successors, (1710) [2024-10-24 03:00:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13900 states to 13900 states and 22166 transitions. [2024-10-24 03:00:32,261 INFO L78 Accepts]: Start accepts. Automaton has 13900 states and 22166 transitions. Word has length 111 [2024-10-24 03:00:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:32,262 INFO L471 AbstractCegarLoop]: Abstraction has 13900 states and 22166 transitions. [2024-10-24 03:00:32,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 13900 states and 22166 transitions. [2024-10-24 03:00:32,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 03:00:32,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:32,273 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] [2024-10-24 03:00:32,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 03:00:32,273 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:32,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:32,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1052177176, now seen corresponding path program 1 times [2024-10-24 03:00:32,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:32,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827276465] [2024-10-24 03:00:32,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:32,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:32,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:32,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:00:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:32,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 03:00:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:32,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 03:00:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:32,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 03:00:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:32,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:32,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827276465] [2024-10-24 03:00:32,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827276465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:32,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:32,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:32,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818055797] [2024-10-24 03:00:32,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:32,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:32,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:32,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:32,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:32,528 INFO L87 Difference]: Start difference. First operand 13900 states and 22166 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:37,619 INFO L93 Difference]: Finished difference Result 49854 states and 80385 transitions. [2024-10-24 03:00:37,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 03:00:37,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-24 03:00:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:37,771 INFO L225 Difference]: With dead ends: 49854 [2024-10-24 03:00:37,772 INFO L226 Difference]: Without dead ends: 35968 [2024-10-24 03:00:37,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:00:37,818 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 924 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 2348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:37,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 1312 Invalid, 2348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 03:00:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35968 states. [2024-10-24 03:00:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35968 to 27630. [2024-10-24 03:00:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27630 states, 24978 states have (on average 1.5587717191128192) internal successors, (38935), 25107 states have internal predecessors, (38935), 1749 states have call successors, (1749), 774 states have call predecessors, (1749), 902 states have return successors, (4064), 1876 states have call predecessors, (4064), 1749 states have call successors, (4064) [2024-10-24 03:00:41,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27630 states to 27630 states and 44748 transitions. [2024-10-24 03:00:41,355 INFO L78 Accepts]: Start accepts. Automaton has 27630 states and 44748 transitions. Word has length 111 [2024-10-24 03:00:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:41,356 INFO L471 AbstractCegarLoop]: Abstraction has 27630 states and 44748 transitions. [2024-10-24 03:00:41,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 27630 states and 44748 transitions. [2024-10-24 03:00:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 03:00:41,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:41,384 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] [2024-10-24 03:00:41,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 03:00:41,384 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:41,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:41,384 INFO L85 PathProgramCache]: Analyzing trace with hash -5660902, now seen corresponding path program 1 times [2024-10-24 03:00:41,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:41,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905015291] [2024-10-24 03:00:41,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:41,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:41,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:41,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:00:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:41,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 03:00:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:41,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 03:00:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:41,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 03:00:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:41,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:41,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905015291] [2024-10-24 03:00:41,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905015291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:41,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:41,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:00:41,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298883878] [2024-10-24 03:00:41,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:41,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:00:41,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:41,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:00:41,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:00:41,537 INFO L87 Difference]: Start difference. First operand 27630 states and 44748 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:48,773 INFO L93 Difference]: Finished difference Result 97246 states and 159433 transitions. [2024-10-24 03:00:48,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 03:00:48,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-24 03:00:48,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:49,076 INFO L225 Difference]: With dead ends: 97246 [2024-10-24 03:00:49,076 INFO L226 Difference]: Without dead ends: 69630 [2024-10-24 03:00:49,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 03:00:49,159 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 969 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:49,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 870 Invalid, 1888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 03:00:49,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69630 states. [2024-10-24 03:00:54,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69630 to 55087. [2024-10-24 03:00:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55087 states, 49939 states have (on average 1.5588818358397245) internal successors, (77849), 50196 states have internal predecessors, (77849), 3349 states have call successors, (3349), 1542 states have call predecessors, (3349), 1798 states have return successors, (10166), 3604 states have call predecessors, (10166), 3349 states have call successors, (10166) [2024-10-24 03:00:54,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55087 states to 55087 states and 91364 transitions. [2024-10-24 03:00:54,430 INFO L78 Accepts]: Start accepts. Automaton has 55087 states and 91364 transitions. Word has length 111 [2024-10-24 03:00:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:54,431 INFO L471 AbstractCegarLoop]: Abstraction has 55087 states and 91364 transitions. [2024-10-24 03:00:54,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:00:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 55087 states and 91364 transitions. [2024-10-24 03:00:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 03:00:54,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:54,472 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] [2024-10-24 03:00:54,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 03:00:54,473 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:54,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:54,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1148163368, now seen corresponding path program 1 times [2024-10-24 03:00:54,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:54,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704114412] [2024-10-24 03:00:54,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:54,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:54,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:00:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:54,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 03:00:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:54,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 03:00:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:54,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 03:00:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:54,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 03:00:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:54,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:54,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:54,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704114412] [2024-10-24 03:00:54,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704114412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:54,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:54,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:00:54,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316143168] [2024-10-24 03:00:54,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:54,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:00:54,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:54,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:00:54,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:00:54,626 INFO L87 Difference]: Start difference. First operand 55087 states and 91364 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)