./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb07c62e0c8f9c002ab72b797de071664dce20871b109c1b4c0b79acbb73493c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:54:38,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:54:38,457 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:54:38,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:54:38,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:54:38,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:54:38,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:54:38,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:54:38,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:54:38,488 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:54:38,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:54:38,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:54:38,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:54:38,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:54:38,493 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:54:38,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:54:38,493 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:54:38,493 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:54:38,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:54:38,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:54:38,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:54:38,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:54:38,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:54:38,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:54:38,495 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:54:38,496 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:54:38,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:54:38,496 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:54:38,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:54:38,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:54:38,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:54:38,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:54:38,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:54:38,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:54:38,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:54:38,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:54:38,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:54:38,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:54:38,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:54:38,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:54:38,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:54:38,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:54:38,499 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 -> cb07c62e0c8f9c002ab72b797de071664dce20871b109c1b4c0b79acbb73493c [2024-11-11 22:54:38,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:54:38,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:54:38,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:54:38,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:54:38,712 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:54:38,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c [2024-11-11 22:54:39,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:54:40,142 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:54:40,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c [2024-11-11 22:54:40,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad158867/7da9f2f693b243b18199d737017da43f/FLAG313cd89e2 [2024-11-11 22:54:40,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad158867/7da9f2f693b243b18199d737017da43f [2024-11-11 22:54:40,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:54:40,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:54:40,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:54:40,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:54:40,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:54:40,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:40,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbed5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40, skipping insertion in model container [2024-11-11 22:54:40,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:40,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:54:40,696 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c[913,926] [2024-11-11 22:54:40,750 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c[5977,5990] [2024-11-11 22:54:40,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:54:40,875 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:54:40,887 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c[913,926] [2024-11-11 22:54:40,900 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c[5977,5990] [2024-11-11 22:54:40,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:54:40,980 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:54:40,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40 WrapperNode [2024-11-11 22:54:40,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:54:40,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:54:40,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:54:40,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:54:40,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:40,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:41,036 INFO L138 Inliner]: procedures = 72, calls = 84, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1083 [2024-11-11 22:54:41,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:54:41,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:54:41,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:54:41,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:54:41,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:41,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:41,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:41,074 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 22:54:41,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:41,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:41,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:41,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:41,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:41,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:41,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:54:41,125 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:54:41,125 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:54:41,125 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:54:41,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:41,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:54:41,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:54:41,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:54:41,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:54:41,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:54:41,204 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:54:41,204 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:54:41,204 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-11 22:54:41,206 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-11 22:54:41,206 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-11 22:54:41,206 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-11 22:54:41,206 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-11 22:54:41,206 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-11 22:54:41,206 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-11 22:54:41,206 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-11 22:54:41,206 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-11 22:54:41,206 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-11 22:54:41,207 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-11 22:54:41,207 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-11 22:54:41,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:54:41,207 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-11 22:54:41,207 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-11 22:54:41,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:54:41,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:54:41,208 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-11 22:54:41,208 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-11 22:54:41,324 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:54:41,326 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:54:42,064 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-11 22:54:42,064 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:54:42,112 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:54:42,112 INFO L316 CfgBuilder]: Removed 19 assume(true) statements. [2024-11-11 22:54:42,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:54:42 BoogieIcfgContainer [2024-11-11 22:54:42,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:54:42,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:54:42,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:54:42,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:54:42,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:54:40" (1/3) ... [2024-11-11 22:54:42,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3c95d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:54:42, skipping insertion in model container [2024-11-11 22:54:42,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (2/3) ... [2024-11-11 22:54:42,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3c95d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:54:42, skipping insertion in model container [2024-11-11 22:54:42,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:54:42" (3/3) ... [2024-11-11 22:54:42,124 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.12.cil-2.c [2024-11-11 22:54:42,136 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:54:42,136 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:54:42,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:54:42,207 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;@2883f514, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:54:42,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:54:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 467 states, 423 states have (on average 1.6288416075650118) internal successors, (689), 428 states have internal predecessors, (689), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-11 22:54:42,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 22:54:42,225 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:42,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:42,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:42,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:42,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1208991052, now seen corresponding path program 1 times [2024-11-11 22:54:42,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:42,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501925635] [2024-11-11 22:54:42,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:42,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:42,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:42,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 22:54:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:42,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:42,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501925635] [2024-11-11 22:54:42,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501925635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:42,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:42,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:54:42,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682956116] [2024-11-11 22:54:42,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:42,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:42,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:42,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:42,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:54:42,659 INFO L87 Difference]: Start difference. First operand has 467 states, 423 states have (on average 1.6288416075650118) internal successors, (689), 428 states have internal predecessors, (689), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-11-11 22:54:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:43,244 INFO L93 Difference]: Finished difference Result 979 states and 1574 transitions. [2024-11-11 22:54:43,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:54:43,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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 44 [2024-11-11 22:54:43,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:43,268 INFO L225 Difference]: With dead ends: 979 [2024-11-11 22:54:43,268 INFO L226 Difference]: Without dead ends: 527 [2024-11-11 22:54:43,277 INFO L434 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-11-11 22:54:43,281 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 956 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:43,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 870 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:54:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-11 22:54:43,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 521. [2024-11-11 22:54:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 472 states have (on average 1.5169491525423728) internal successors, (716), 476 states have internal predecessors, (716), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (40), 34 states have call predecessors, (40), 34 states have call successors, (40) [2024-11-11 22:54:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 792 transitions. [2024-11-11 22:54:43,368 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 792 transitions. Word has length 44 [2024-11-11 22:54:43,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:43,368 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 792 transitions. [2024-11-11 22:54:43,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-11-11 22:54:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 792 transitions. [2024-11-11 22:54:43,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 22:54:43,371 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:43,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:43,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:54:43,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:43,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:43,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1452845587, now seen corresponding path program 1 times [2024-11-11 22:54:43,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:43,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435590163] [2024-11-11 22:54:43,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:43,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:43,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:43,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 22:54:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:43,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435590163] [2024-11-11 22:54:43,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435590163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:43,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:43,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:54:43,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565798500] [2024-11-11 22:54:43,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:43,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:43,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:43,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:43,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:54:43,531 INFO L87 Difference]: Start difference. First operand 521 states and 792 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-11 22:54:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:44,053 INFO L93 Difference]: Finished difference Result 769 states and 1132 transitions. [2024-11-11 22:54:44,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:54:44,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 45 [2024-11-11 22:54:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:44,058 INFO L225 Difference]: With dead ends: 769 [2024-11-11 22:54:44,059 INFO L226 Difference]: Without dead ends: 645 [2024-11-11 22:54:44,059 INFO L434 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-11-11 22:54:44,060 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 369 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:44,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1213 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:54:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-11-11 22:54:44,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 588. [2024-11-11 22:54:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 533 states have (on average 1.5009380863039399) internal successors, (800), 537 states have internal predecessors, (800), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (43), 37 states have call predecessors, (43), 37 states have call successors, (43) [2024-11-11 22:54:44,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 882 transitions. [2024-11-11 22:54:44,093 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 882 transitions. Word has length 45 [2024-11-11 22:54:44,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:44,093 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 882 transitions. [2024-11-11 22:54:44,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-11 22:54:44,094 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 882 transitions. [2024-11-11 22:54:44,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 22:54:44,095 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:44,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:44,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:54:44,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:44,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:44,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1557764248, now seen corresponding path program 1 times [2024-11-11 22:54:44,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:44,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020044135] [2024-11-11 22:54:44,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:44,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:44,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:44,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 22:54:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:44,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:44,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020044135] [2024-11-11 22:54:44,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020044135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:44,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:44,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:54:44,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22608241] [2024-11-11 22:54:44,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:44,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:44,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:44,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:44,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:54:44,162 INFO L87 Difference]: Start difference. First operand 588 states and 882 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-11 22:54:44,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:44,602 INFO L93 Difference]: Finished difference Result 996 states and 1441 transitions. [2024-11-11 22:54:44,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:54:44,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 45 [2024-11-11 22:54:44,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:44,606 INFO L225 Difference]: With dead ends: 996 [2024-11-11 22:54:44,606 INFO L226 Difference]: Without dead ends: 805 [2024-11-11 22:54:44,607 INFO L434 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-11-11 22:54:44,608 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 966 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:44,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 869 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:54:44,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-11 22:54:44,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 753. [2024-11-11 22:54:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 679 states have (on average 1.4580265095729013) internal successors, (990), 686 states have internal predecessors, (990), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (60), 46 states have call predecessors, (60), 48 states have call successors, (60) [2024-11-11 22:54:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1100 transitions. [2024-11-11 22:54:44,659 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1100 transitions. Word has length 45 [2024-11-11 22:54:44,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:44,659 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1100 transitions. [2024-11-11 22:54:44,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-11 22:54:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1100 transitions. [2024-11-11 22:54:44,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 22:54:44,664 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:44,664 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:44,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:54:44,664 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:44,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:44,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1791650148, now seen corresponding path program 1 times [2024-11-11 22:54:44,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:44,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986513613] [2024-11-11 22:54:44,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:44,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:44,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:44,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 22:54:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:44,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:54:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 22:54:44,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:44,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986513613] [2024-11-11 22:54:44,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986513613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:44,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:44,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:54:44,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305044007] [2024-11-11 22:54:44,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:44,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:44,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:44,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:44,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:54:44,789 INFO L87 Difference]: Start difference. First operand 753 states and 1100 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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-11-11 22:54:45,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:45,254 INFO L93 Difference]: Finished difference Result 1337 states and 1885 transitions. [2024-11-11 22:54:45,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:54:45,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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 62 [2024-11-11 22:54:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:45,258 INFO L225 Difference]: With dead ends: 1337 [2024-11-11 22:54:45,259 INFO L226 Difference]: Without dead ends: 981 [2024-11-11 22:54:45,259 INFO L434 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-11-11 22:54:45,260 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 353 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:45,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1263 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:54:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2024-11-11 22:54:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 943. [2024-11-11 22:54:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 845 states have (on average 1.4082840236686391) internal successors, (1190), 854 states have internal predecessors, (1190), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (84), 60 states have call predecessors, (84), 62 states have call successors, (84) [2024-11-11 22:54:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1338 transitions. [2024-11-11 22:54:45,295 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1338 transitions. Word has length 62 [2024-11-11 22:54:45,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:45,296 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1338 transitions. [2024-11-11 22:54:45,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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-11-11 22:54:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1338 transitions. [2024-11-11 22:54:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 22:54:45,300 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:45,300 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:45,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:54:45,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:45,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:45,301 INFO L85 PathProgramCache]: Analyzing trace with hash -298876425, now seen corresponding path program 1 times [2024-11-11 22:54:45,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:45,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355365429] [2024-11-11 22:54:45,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:45,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:45,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:45,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:54:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:45,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:54:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 22:54:45,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:45,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355365429] [2024-11-11 22:54:45,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355365429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:45,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:45,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:54:45,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832993759] [2024-11-11 22:54:45,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:45,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:45,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:45,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:45,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:54:45,358 INFO L87 Difference]: Start difference. First operand 943 states and 1338 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-11-11 22:54:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:45,743 INFO L93 Difference]: Finished difference Result 1596 states and 2191 transitions. [2024-11-11 22:54:45,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:54:45,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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 67 [2024-11-11 22:54:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:45,751 INFO L225 Difference]: With dead ends: 1596 [2024-11-11 22:54:45,752 INFO L226 Difference]: Without dead ends: 1142 [2024-11-11 22:54:45,753 INFO L434 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-11-11 22:54:45,753 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 953 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:45,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 868 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 22:54:45,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-11-11 22:54:45,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1087. [2024-11-11 22:54:45,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 973 states have (on average 1.3782117163412126) internal successors, (1341), 984 states have internal predecessors, (1341), 72 states have call successors, (72), 35 states have call predecessors, (72), 40 states have return successors, (98), 68 states have call predecessors, (98), 70 states have call successors, (98) [2024-11-11 22:54:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1511 transitions. [2024-11-11 22:54:45,804 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1511 transitions. Word has length 67 [2024-11-11 22:54:45,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:45,804 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1511 transitions. [2024-11-11 22:54:45,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-11-11 22:54:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1511 transitions. [2024-11-11 22:54:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 22:54:45,806 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:45,806 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:45,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:54:45,806 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:45,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:45,807 INFO L85 PathProgramCache]: Analyzing trace with hash 570483420, now seen corresponding path program 1 times [2024-11-11 22:54:45,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:45,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989383941] [2024-11-11 22:54:45,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:45,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:45,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:45,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:54:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:45,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 22:54:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:54:45,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:45,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989383941] [2024-11-11 22:54:45,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989383941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:54:45,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114935996] [2024-11-11 22:54:45,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:45,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:45,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:54:45,921 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:54:45,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 22:54:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:46,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 22:54:46,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:54:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:46,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:54:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:54:46,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114935996] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 22:54:46,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 22:54:46,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2024-11-11 22:54:46,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701752862] [2024-11-11 22:54:46,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:46,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:46,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:46,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:46,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:54:46,162 INFO L87 Difference]: Start difference. First operand 1087 states and 1511 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:54:46,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:46,303 INFO L93 Difference]: Finished difference Result 1143 states and 1579 transitions. [2024-11-11 22:54:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 22:54:46,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 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 68 [2024-11-11 22:54:46,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:46,308 INFO L225 Difference]: With dead ends: 1143 [2024-11-11 22:54:46,309 INFO L226 Difference]: Without dead ends: 1140 [2024-11-11 22:54:46,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:54:46,313 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 1285 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:46,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 792 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:54:46,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2024-11-11 22:54:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1086. [2024-11-11 22:54:46,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 973 states have (on average 1.3761562178828366) internal successors, (1339), 983 states have internal predecessors, (1339), 71 states have call successors, (71), 35 states have call predecessors, (71), 40 states have return successors, (98), 68 states have call predecessors, (98), 70 states have call successors, (98) [2024-11-11 22:54:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1508 transitions. [2024-11-11 22:54:46,369 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1508 transitions. Word has length 68 [2024-11-11 22:54:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:46,369 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1508 transitions. [2024-11-11 22:54:46,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:54:46,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1508 transitions. [2024-11-11 22:54:46,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-11 22:54:46,371 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:46,371 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:46,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 22:54:46,572 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-11-11 22:54:46,573 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:46,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:46,573 INFO L85 PathProgramCache]: Analyzing trace with hash 503711194, now seen corresponding path program 1 times [2024-11-11 22:54:46,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:46,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69307499] [2024-11-11 22:54:46,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:46,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:46,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:46,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:54:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:46,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 22:54:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:46,657 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:54:46,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:46,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69307499] [2024-11-11 22:54:46,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69307499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:54:46,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707408930] [2024-11-11 22:54:46,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:46,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:46,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:54:46,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:54:46,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 22:54:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:46,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 22:54:46,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:54:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:46,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:54:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:54:47,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707408930] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:54:47,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:54:47,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2024-11-11 22:54:47,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033020118] [2024-11-11 22:54:47,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:54:47,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 22:54:47,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:47,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 22:54:47,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:54:47,042 INFO L87 Difference]: Start difference. First operand 1086 states and 1508 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 22:54:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:48,390 INFO L93 Difference]: Finished difference Result 2593 states and 3496 transitions. [2024-11-11 22:54:48,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 22:54:48,391 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2024-11-11 22:54:48,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:48,408 INFO L225 Difference]: With dead ends: 2593 [2024-11-11 22:54:48,409 INFO L226 Difference]: Without dead ends: 2049 [2024-11-11 22:54:48,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-11 22:54:48,415 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 1746 mSDsluCounter, 3218 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1779 SdHoareTripleChecker+Valid, 3731 SdHoareTripleChecker+Invalid, 2598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:48,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1779 Valid, 3731 Invalid, 2598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:54:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2024-11-11 22:54:48,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1449. [2024-11-11 22:54:48,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1297 states have (on average 1.340786430223593) internal successors, (1739), 1315 states have internal predecessors, (1739), 91 states have call successors, (91), 49 states have call predecessors, (91), 59 states have return successors, (132), 85 states have call predecessors, (132), 90 states have call successors, (132) [2024-11-11 22:54:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 1962 transitions. [2024-11-11 22:54:48,471 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 1962 transitions. Word has length 69 [2024-11-11 22:54:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:48,473 INFO L471 AbstractCegarLoop]: Abstraction has 1449 states and 1962 transitions. [2024-11-11 22:54:48,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 22:54:48,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1962 transitions. [2024-11-11 22:54:48,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-11 22:54:48,476 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:48,476 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2024-11-11 22:54:48,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 22:54:48,676 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-11-11 22:54:48,677 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:48,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:48,677 INFO L85 PathProgramCache]: Analyzing trace with hash -103634784, now seen corresponding path program 1 times [2024-11-11 22:54:48,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:48,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343322107] [2024-11-11 22:54:48,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:48,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:48,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:48,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:54:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:48,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:54:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:48,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 22:54:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-11 22:54:48,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:48,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343322107] [2024-11-11 22:54:48,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343322107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:54:48,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388457369] [2024-11-11 22:54:48,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:48,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:48,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:54:48,771 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:54:48,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 22:54:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:48,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 22:54:48,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:54:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:54:48,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:54:48,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388457369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:48,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:54:48,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 22:54:48,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313491572] [2024-11-11 22:54:48,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:48,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:54:48,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:48,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:54:48,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:48,886 INFO L87 Difference]: Start difference. First operand 1449 states and 1962 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 22:54:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:48,942 INFO L93 Difference]: Finished difference Result 2146 states and 2866 transitions. [2024-11-11 22:54:48,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:54:48,943 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2024-11-11 22:54:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:48,947 INFO L225 Difference]: With dead ends: 2146 [2024-11-11 22:54:48,947 INFO L226 Difference]: Without dead ends: 1327 [2024-11-11 22:54:48,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:48,949 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 661 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:48,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 806 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:54:48,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2024-11-11 22:54:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1312. [2024-11-11 22:54:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1176 states have (on average 1.344387755102041) internal successors, (1581), 1193 states have internal predecessors, (1581), 83 states have call successors, (83), 43 states have call predecessors, (83), 51 states have return successors, (118), 76 states have call predecessors, (118), 82 states have call successors, (118) [2024-11-11 22:54:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1782 transitions. [2024-11-11 22:54:49,014 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1782 transitions. Word has length 88 [2024-11-11 22:54:49,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:49,014 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1782 transitions. [2024-11-11 22:54:49,014 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 22:54:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1782 transitions. [2024-11-11 22:54:49,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 22:54:49,017 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:49,017 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 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-11-11 22:54:49,031 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-11-11 22:54:49,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:49,222 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:49,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:49,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2097052475, now seen corresponding path program 1 times [2024-11-11 22:54:49,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:49,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433036544] [2024-11-11 22:54:49,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:49,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:54:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:54:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 22:54:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 22:54:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 22:54:49,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:49,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433036544] [2024-11-11 22:54:49,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433036544] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:54:49,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035753235] [2024-11-11 22:54:49,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:49,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:49,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:54:49,317 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:54:49,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 22:54:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 22:54:49,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:54:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 22:54:49,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:54:49,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035753235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:49,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:54:49,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 22:54:49,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036720070] [2024-11-11 22:54:49,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:49,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:54:49,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:49,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:54:49,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:49,443 INFO L87 Difference]: Start difference. First operand 1312 states and 1782 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-11-11 22:54:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:49,489 INFO L93 Difference]: Finished difference Result 1691 states and 2250 transitions. [2024-11-11 22:54:49,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:54:49,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 103 [2024-11-11 22:54:49,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:49,492 INFO L225 Difference]: With dead ends: 1691 [2024-11-11 22:54:49,492 INFO L226 Difference]: Without dead ends: 391 [2024-11-11 22:54:49,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:49,495 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 62 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:49,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1422 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:54:49,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-11 22:54:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-11 22:54:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 358 states have (on average 1.5558659217877095) internal successors, (557), 359 states have internal predecessors, (557), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-11 22:54:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 609 transitions. [2024-11-11 22:54:49,507 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 609 transitions. Word has length 103 [2024-11-11 22:54:49,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:49,508 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 609 transitions. [2024-11-11 22:54:49,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-11-11 22:54:49,508 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 609 transitions. [2024-11-11 22:54:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:54:49,509 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:49,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:49,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 22:54:49,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:49,710 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:49,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:49,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1351627141, now seen corresponding path program 1 times [2024-11-11 22:54:49,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:49,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743181290] [2024-11-11 22:54:49,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:49,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:54:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:54:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:54:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:54:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:49,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:49,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743181290] [2024-11-11 22:54:49,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743181290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:49,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:49,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:54:49,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880218183] [2024-11-11 22:54:49,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:49,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:54:49,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:49,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:54:49,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:54:49,880 INFO L87 Difference]: Start difference. First operand 391 states and 609 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-11-11 22:54:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:51,292 INFO L93 Difference]: Finished difference Result 917 states and 1454 transitions. [2024-11-11 22:54:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:54:51,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 178 [2024-11-11 22:54:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:51,295 INFO L225 Difference]: With dead ends: 917 [2024-11-11 22:54:51,296 INFO L226 Difference]: Without dead ends: 533 [2024-11-11 22:54:51,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:54:51,297 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 1047 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:51,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 775 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:54:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-11 22:54:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 391. [2024-11-11 22:54:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 358 states have (on average 1.553072625698324) internal successors, (556), 359 states have internal predecessors, (556), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-11 22:54:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 608 transitions. [2024-11-11 22:54:51,314 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 608 transitions. Word has length 178 [2024-11-11 22:54:51,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:51,315 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 608 transitions. [2024-11-11 22:54:51,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-11-11 22:54:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 608 transitions. [2024-11-11 22:54:51,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:54:51,317 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:51,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:51,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:54:51,317 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:51,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:51,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1440241849, now seen corresponding path program 1 times [2024-11-11 22:54:51,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:51,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446365622] [2024-11-11 22:54:51,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:51,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:51,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:51,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:54:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:51,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:54:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:51,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:54:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:51,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:54:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:51,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:51,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:51,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446365622] [2024-11-11 22:54:51,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446365622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:51,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:51,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:54:51,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229156657] [2024-11-11 22:54:51,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:51,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:54:51,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:51,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:54:51,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:54:51,483 INFO L87 Difference]: Start difference. First operand 391 states and 608 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-11-11 22:54:52,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:52,859 INFO L93 Difference]: Finished difference Result 909 states and 1437 transitions. [2024-11-11 22:54:52,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:54:52,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 178 [2024-11-11 22:54:52,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:52,864 INFO L225 Difference]: With dead ends: 909 [2024-11-11 22:54:52,864 INFO L226 Difference]: Without dead ends: 533 [2024-11-11 22:54:52,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:54:52,866 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 1038 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:52,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 773 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:54:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-11 22:54:52,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 391. [2024-11-11 22:54:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 358 states have (on average 1.5502793296089385) internal successors, (555), 359 states have internal predecessors, (555), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-11 22:54:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 607 transitions. [2024-11-11 22:54:52,887 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 607 transitions. Word has length 178 [2024-11-11 22:54:52,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:52,889 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 607 transitions. [2024-11-11 22:54:52,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-11-11 22:54:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 607 transitions. [2024-11-11 22:54:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:54:52,891 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:52,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:52,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:54:52,891 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:52,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:52,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2010513655, now seen corresponding path program 1 times [2024-11-11 22:54:52,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:52,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143990435] [2024-11-11 22:54:52,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:52,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:52,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:53,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:54:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:53,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:54:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:53,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:54:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:53,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:54:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:53,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:53,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143990435] [2024-11-11 22:54:53,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143990435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:53,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:53,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:54:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767812120] [2024-11-11 22:54:53,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:53,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:54:53,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:53,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:54:53,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:54:53,126 INFO L87 Difference]: Start difference. First operand 391 states and 607 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:55,241 INFO L93 Difference]: Finished difference Result 1433 states and 2280 transitions. [2024-11-11 22:54:55,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:54:55,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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 178 [2024-11-11 22:54:55,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:55,245 INFO L225 Difference]: With dead ends: 1433 [2024-11-11 22:54:55,245 INFO L226 Difference]: Without dead ends: 1063 [2024-11-11 22:54:55,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:54:55,246 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 1573 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1592 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 2372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:55,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1592 Valid, 1323 Invalid, 2372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 22:54:55,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2024-11-11 22:54:55,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 780. [2024-11-11 22:54:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 719 states have (on average 1.5632823365785813) internal successors, (1124), 721 states have internal predecessors, (1124), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-11-11 22:54:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1221 transitions. [2024-11-11 22:54:55,282 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1221 transitions. Word has length 178 [2024-11-11 22:54:55,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:55,282 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1221 transitions. [2024-11-11 22:54:55,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:55,283 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1221 transitions. [2024-11-11 22:54:55,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:54:55,284 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:55,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:55,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:54:55,284 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:55,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:55,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1408468365, now seen corresponding path program 1 times [2024-11-11 22:54:55,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:55,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107220877] [2024-11-11 22:54:55,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:55,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:54:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:54:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:54:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:54:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:55,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:55,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107220877] [2024-11-11 22:54:55,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107220877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:55,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:55,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:55,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970957683] [2024-11-11 22:54:55,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:55,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:55,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:55,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:55,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:55,524 INFO L87 Difference]: Start difference. First operand 780 states and 1221 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:58,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:58,470 INFO L93 Difference]: Finished difference Result 2372 states and 3780 transitions. [2024-11-11 22:54:58,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:54:58,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-11 22:54:58,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:58,476 INFO L225 Difference]: With dead ends: 2372 [2024-11-11 22:54:58,476 INFO L226 Difference]: Without dead ends: 1613 [2024-11-11 22:54:58,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:54:58,478 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 1616 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 3582 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 2567 SdHoareTripleChecker+Invalid, 3643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:58,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 2567 Invalid, 3643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3582 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 22:54:58,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2024-11-11 22:54:58,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1142. [2024-11-11 22:54:58,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1053 states have (on average 1.5565052231718899) internal successors, (1639), 1056 states have internal predecessors, (1639), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-11-11 22:54:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1780 transitions. [2024-11-11 22:54:58,528 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1780 transitions. Word has length 178 [2024-11-11 22:54:58,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:58,528 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1780 transitions. [2024-11-11 22:54:58,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1780 transitions. [2024-11-11 22:54:58,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:54:58,530 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:58,530 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:58,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:54:58,530 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:58,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:58,531 INFO L85 PathProgramCache]: Analyzing trace with hash 797199307, now seen corresponding path program 1 times [2024-11-11 22:54:58,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:58,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162650709] [2024-11-11 22:54:58,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:58,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:58,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:58,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:54:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:58,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:54:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:58,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:54:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:58,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:54:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:58,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:58,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162650709] [2024-11-11 22:54:58,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162650709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:58,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:58,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:58,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55360637] [2024-11-11 22:54:58,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:58,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:58,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:58,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:58,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:58,757 INFO L87 Difference]: Start difference. First operand 1142 states and 1780 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:00,138 INFO L93 Difference]: Finished difference Result 2752 states and 4381 transitions. [2024-11-11 22:55:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:55:00,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-11 22:55:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:00,144 INFO L225 Difference]: With dead ends: 2752 [2024-11-11 22:55:00,144 INFO L226 Difference]: Without dead ends: 1631 [2024-11-11 22:55:00,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:55:00,146 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 1240 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:00,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 1294 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:55:00,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2024-11-11 22:55:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1142. [2024-11-11 22:55:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1053 states have (on average 1.553656220322887) internal successors, (1636), 1056 states have internal predecessors, (1636), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-11-11 22:55:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1777 transitions. [2024-11-11 22:55:00,203 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1777 transitions. Word has length 178 [2024-11-11 22:55:00,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:00,204 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1777 transitions. [2024-11-11 22:55:00,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:00,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1777 transitions. [2024-11-11 22:55:00,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:55:00,206 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:00,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:00,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:55:00,206 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:00,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:00,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1603434103, now seen corresponding path program 1 times [2024-11-11 22:55:00,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:00,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449911395] [2024-11-11 22:55:00,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:00,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:00,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:00,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:00,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:00,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:00,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:00,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:00,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:00,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449911395] [2024-11-11 22:55:00,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449911395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:00,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:00,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:00,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719865159] [2024-11-11 22:55:00,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:00,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:00,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:00,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:00,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:00,463 INFO L87 Difference]: Start difference. First operand 1142 states and 1777 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:01,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:01,755 INFO L93 Difference]: Finished difference Result 2748 states and 4364 transitions. [2024-11-11 22:55:01,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:55:01,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-11 22:55:01,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:01,760 INFO L225 Difference]: With dead ends: 2748 [2024-11-11 22:55:01,761 INFO L226 Difference]: Without dead ends: 1627 [2024-11-11 22:55:01,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:55:01,763 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 1314 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:01,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 1088 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 22:55:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2024-11-11 22:55:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1142. [2024-11-11 22:55:01,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1053 states have (on average 1.550807217473884) internal successors, (1633), 1056 states have internal predecessors, (1633), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-11-11 22:55:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1774 transitions. [2024-11-11 22:55:01,813 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1774 transitions. Word has length 178 [2024-11-11 22:55:01,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:01,814 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1774 transitions. [2024-11-11 22:55:01,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:01,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1774 transitions. [2024-11-11 22:55:01,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:55:01,815 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:01,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:01,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:55:01,815 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:01,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:01,816 INFO L85 PathProgramCache]: Analyzing trace with hash -156853237, now seen corresponding path program 1 times [2024-11-11 22:55:01,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:01,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221587501] [2024-11-11 22:55:01,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:01,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:01,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:01,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:02,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:02,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:02,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:02,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:02,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:02,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221587501] [2024-11-11 22:55:02,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221587501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:02,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:02,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:02,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908727618] [2024-11-11 22:55:02,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:02,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:02,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:02,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:02,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:02,043 INFO L87 Difference]: Start difference. First operand 1142 states and 1774 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:04,925 INFO L93 Difference]: Finished difference Result 3748 states and 5929 transitions. [2024-11-11 22:55:04,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:55:04,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-11 22:55:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:04,934 INFO L225 Difference]: With dead ends: 3748 [2024-11-11 22:55:04,934 INFO L226 Difference]: Without dead ends: 2627 [2024-11-11 22:55:04,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:55:04,938 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 1596 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 3511 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1615 SdHoareTripleChecker+Valid, 2565 SdHoareTripleChecker+Invalid, 3574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:04,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1615 Valid, 2565 Invalid, 3574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3511 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 22:55:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2024-11-11 22:55:05,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 1876. [2024-11-11 22:55:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1731 states have (on average 1.5447718082033506) internal successors, (2674), 1736 states have internal predecessors, (2674), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-11-11 22:55:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2907 transitions. [2024-11-11 22:55:05,053 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2907 transitions. Word has length 178 [2024-11-11 22:55:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:05,054 INFO L471 AbstractCegarLoop]: Abstraction has 1876 states and 2907 transitions. [2024-11-11 22:55:05,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2907 transitions. [2024-11-11 22:55:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:55:05,055 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:05,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:05,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:55:05,056 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:05,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:05,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1080020663, now seen corresponding path program 1 times [2024-11-11 22:55:05,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:05,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995152732] [2024-11-11 22:55:05,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:05,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:05,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:05,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:05,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:05,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:05,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:05,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:05,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:05,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995152732] [2024-11-11 22:55:05,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995152732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:05,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:05,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:05,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962204435] [2024-11-11 22:55:05,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:05,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:05,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:05,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:05,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:05,247 INFO L87 Difference]: Start difference. First operand 1876 states and 2907 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:06,826 INFO L93 Difference]: Finished difference Result 4470 states and 7051 transitions. [2024-11-11 22:55:06,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:55:06,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-11 22:55:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:06,836 INFO L225 Difference]: With dead ends: 4470 [2024-11-11 22:55:06,837 INFO L226 Difference]: Without dead ends: 2615 [2024-11-11 22:55:06,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:55:06,840 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 1313 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:06,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1333 Valid, 1088 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:55:06,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2615 states. [2024-11-11 22:55:06,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2615 to 1876. [2024-11-11 22:55:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1731 states have (on average 1.5418833044482958) internal successors, (2669), 1736 states have internal predecessors, (2669), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-11-11 22:55:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2902 transitions. [2024-11-11 22:55:06,946 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2902 transitions. Word has length 178 [2024-11-11 22:55:06,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:06,946 INFO L471 AbstractCegarLoop]: Abstraction has 1876 states and 2902 transitions. [2024-11-11 22:55:06,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:06,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2902 transitions. [2024-11-11 22:55:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:55:06,948 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:06,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:06,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 22:55:06,948 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:06,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:06,949 INFO L85 PathProgramCache]: Analyzing trace with hash -694158261, now seen corresponding path program 1 times [2024-11-11 22:55:06,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:06,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622363299] [2024-11-11 22:55:06,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:06,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:07,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:07,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:07,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:07,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:07,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:07,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:07,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622363299] [2024-11-11 22:55:07,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622363299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:07,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:07,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:07,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064265830] [2024-11-11 22:55:07,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:07,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:07,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:07,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:07,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:07,166 INFO L87 Difference]: Start difference. First operand 1876 states and 2902 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:09,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:09,967 INFO L93 Difference]: Finished difference Result 6414 states and 10074 transitions. [2024-11-11 22:55:09,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:55:09,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-11 22:55:09,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:09,980 INFO L225 Difference]: With dead ends: 6414 [2024-11-11 22:55:09,980 INFO L226 Difference]: Without dead ends: 4559 [2024-11-11 22:55:09,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:55:09,984 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 1588 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 3473 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1607 SdHoareTripleChecker+Valid, 2565 SdHoareTripleChecker+Invalid, 3536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:09,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1607 Valid, 2565 Invalid, 3536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3473 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 22:55:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4559 states. [2024-11-11 22:55:10,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4559 to 3346. [2024-11-11 22:55:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3346 states, 3089 states have (on average 1.536095823891227) internal successors, (4745), 3098 states have internal predecessors, (4745), 194 states have call successors, (194), 54 states have call predecessors, (194), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-11-11 22:55:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 5168 transitions. [2024-11-11 22:55:10,223 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 5168 transitions. Word has length 178 [2024-11-11 22:55:10,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:10,223 INFO L471 AbstractCegarLoop]: Abstraction has 3346 states and 5168 transitions. [2024-11-11 22:55:10,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:10,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 5168 transitions. [2024-11-11 22:55:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:55:10,225 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:10,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:10,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:55:10,226 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:10,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:10,226 INFO L85 PathProgramCache]: Analyzing trace with hash -958805751, now seen corresponding path program 1 times [2024-11-11 22:55:10,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:10,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374691639] [2024-11-11 22:55:10,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:10,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:10,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:10,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:10,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:10,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:10,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:10,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:10,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374691639] [2024-11-11 22:55:10,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374691639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:10,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:10,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:10,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953654168] [2024-11-11 22:55:10,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:10,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:10,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:10,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:10,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:10,397 INFO L87 Difference]: Start difference. First operand 3346 states and 5168 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:11,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:11,941 INFO L93 Difference]: Finished difference Result 7906 states and 12410 transitions. [2024-11-11 22:55:11,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:55:11,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-11 22:55:11,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:11,955 INFO L225 Difference]: With dead ends: 7906 [2024-11-11 22:55:11,955 INFO L226 Difference]: Without dead ends: 4581 [2024-11-11 22:55:11,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:55:11,961 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 1146 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:11,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 1295 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:55:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4581 states. [2024-11-11 22:55:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4581 to 3346. [2024-11-11 22:55:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3346 states, 3089 states have (on average 1.5331822596309486) internal successors, (4736), 3098 states have internal predecessors, (4736), 194 states have call successors, (194), 54 states have call predecessors, (194), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-11-11 22:55:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 5159 transitions. [2024-11-11 22:55:12,134 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 5159 transitions. Word has length 178 [2024-11-11 22:55:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:12,135 INFO L471 AbstractCegarLoop]: Abstraction has 3346 states and 5159 transitions. [2024-11-11 22:55:12,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:12,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 5159 transitions. [2024-11-11 22:55:12,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:55:12,141 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:12,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:12,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 22:55:12,142 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:12,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:12,142 INFO L85 PathProgramCache]: Analyzing trace with hash 972319883, now seen corresponding path program 1 times [2024-11-11 22:55:12,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:12,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80783495] [2024-11-11 22:55:12,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:12,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:12,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:12,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:12,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:12,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:12,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:12,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:12,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80783495] [2024-11-11 22:55:12,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80783495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:12,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:12,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:12,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331382125] [2024-11-11 22:55:12,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:12,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:12,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:12,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:12,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:12,342 INFO L87 Difference]: Start difference. First operand 3346 states and 5159 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:15,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:15,430 INFO L93 Difference]: Finished difference Result 11744 states and 18358 transitions. [2024-11-11 22:55:15,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:55:15,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-11 22:55:15,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:15,452 INFO L225 Difference]: With dead ends: 11744 [2024-11-11 22:55:15,453 INFO L226 Difference]: Without dead ends: 8419 [2024-11-11 22:55:15,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:55:15,460 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 1586 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 3430 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 2565 SdHoareTripleChecker+Invalid, 3493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:15,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 2565 Invalid, 3493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3430 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 22:55:15,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8419 states. [2024-11-11 22:55:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8419 to 6300. [2024-11-11 22:55:15,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6300 states, 5819 states have (on average 1.5287850146073207) internal successors, (8896), 5836 states have internal predecessors, (8896), 362 states have call successors, (362), 102 states have call predecessors, (362), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-11-11 22:55:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 9717 transitions. [2024-11-11 22:55:15,797 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 9717 transitions. Word has length 178 [2024-11-11 22:55:15,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:15,798 INFO L471 AbstractCegarLoop]: Abstraction has 6300 states and 9717 transitions. [2024-11-11 22:55:15,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 9717 transitions. [2024-11-11 22:55:15,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:55:15,803 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:15,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:15,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 22:55:15,803 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:15,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:15,804 INFO L85 PathProgramCache]: Analyzing trace with hash -350859063, now seen corresponding path program 1 times [2024-11-11 22:55:15,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:15,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140066144] [2024-11-11 22:55:15,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:15,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:15,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:15,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:15,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:15,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:15,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:15,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:15,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:15,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140066144] [2024-11-11 22:55:15,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140066144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:15,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:15,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:15,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055906602] [2024-11-11 22:55:15,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:15,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:15,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:15,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:15,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:15,979 INFO L87 Difference]: Start difference. First operand 6300 states and 9717 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:17,587 INFO L93 Difference]: Finished difference Result 14760 states and 23109 transitions. [2024-11-11 22:55:17,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:55:17,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-11 22:55:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:17,608 INFO L225 Difference]: With dead ends: 14760 [2024-11-11 22:55:17,608 INFO L226 Difference]: Without dead ends: 8481 [2024-11-11 22:55:17,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:55:17,621 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 1373 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:17,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1393 Valid, 1087 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 22:55:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8481 states. [2024-11-11 22:55:17,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8481 to 6300. [2024-11-11 22:55:17,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6300 states, 5819 states have (on average 1.5258635504382196) internal successors, (8879), 5836 states have internal predecessors, (8879), 362 states have call successors, (362), 102 states have call predecessors, (362), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-11-11 22:55:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 9700 transitions. [2024-11-11 22:55:17,974 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 9700 transitions. Word has length 178 [2024-11-11 22:55:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:17,974 INFO L471 AbstractCegarLoop]: Abstraction has 6300 states and 9700 transitions. [2024-11-11 22:55:17,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:17,975 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 9700 transitions. [2024-11-11 22:55:17,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:55:17,978 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:17,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:17,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 22:55:17,978 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:17,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:17,978 INFO L85 PathProgramCache]: Analyzing trace with hash -12571513, now seen corresponding path program 1 times [2024-11-11 22:55:17,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:17,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44094435] [2024-11-11 22:55:17,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:17,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:18,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:18,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:18,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:18,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:18,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:18,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:18,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44094435] [2024-11-11 22:55:18,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44094435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:18,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:18,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:18,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980093777] [2024-11-11 22:55:18,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:18,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:18,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:18,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:18,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:18,166 INFO L87 Difference]: Start difference. First operand 6300 states and 9700 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:21,662 INFO L93 Difference]: Finished difference Result 22388 states and 34910 transitions. [2024-11-11 22:55:21,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:55:21,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-11 22:55:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:21,698 INFO L225 Difference]: With dead ends: 22388 [2024-11-11 22:55:21,698 INFO L226 Difference]: Without dead ends: 16109 [2024-11-11 22:55:21,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:55:21,715 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 1574 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 3378 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 2565 SdHoareTripleChecker+Invalid, 3441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:21,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1593 Valid, 2565 Invalid, 3441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3378 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 22:55:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16109 states. [2024-11-11 22:55:22,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16109 to 12255. [2024-11-11 22:55:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12255 states, 11326 states have (on average 1.5233092000706339) internal successors, (17253), 11359 states have internal predecessors, (17253), 698 states have call successors, (698), 198 states have call predecessors, (698), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-11 22:55:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12255 states to 12255 states and 18924 transitions. [2024-11-11 22:55:22,482 INFO L78 Accepts]: Start accepts. Automaton has 12255 states and 18924 transitions. Word has length 178 [2024-11-11 22:55:22,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:22,482 INFO L471 AbstractCegarLoop]: Abstraction has 12255 states and 18924 transitions. [2024-11-11 22:55:22,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:22,482 INFO L276 IsEmpty]: Start isEmpty. Operand 12255 states and 18924 transitions. [2024-11-11 22:55:22,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:55:22,489 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:22,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:22,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 22:55:22,489 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:22,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:22,490 INFO L85 PathProgramCache]: Analyzing trace with hash 413982985, now seen corresponding path program 1 times [2024-11-11 22:55:22,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:22,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260258798] [2024-11-11 22:55:22,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:22,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:22,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:22,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:22,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:22,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:22,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:22,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:22,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260258798] [2024-11-11 22:55:22,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260258798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:22,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:22,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:22,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341540396] [2024-11-11 22:55:22,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:22,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:22,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:22,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:22,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:22,684 INFO L87 Difference]: Start difference. First operand 12255 states and 18924 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:24,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:24,771 INFO L93 Difference]: Finished difference Result 28506 states and 44668 transitions. [2024-11-11 22:55:24,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:55:24,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-11 22:55:24,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:24,820 INFO L225 Difference]: With dead ends: 28506 [2024-11-11 22:55:24,820 INFO L226 Difference]: Without dead ends: 16272 [2024-11-11 22:55:24,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:55:24,849 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 1312 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:24,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 1086 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 22:55:24,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16272 states. [2024-11-11 22:55:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16272 to 12255. [2024-11-11 22:55:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12255 states, 11326 states have (on average 1.5203955500618047) internal successors, (17220), 11359 states have internal predecessors, (17220), 698 states have call successors, (698), 198 states have call predecessors, (698), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-11 22:55:25,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12255 states to 12255 states and 18891 transitions. [2024-11-11 22:55:25,679 INFO L78 Accepts]: Start accepts. Automaton has 12255 states and 18891 transitions. Word has length 178 [2024-11-11 22:55:25,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:25,679 INFO L471 AbstractCegarLoop]: Abstraction has 12255 states and 18891 transitions. [2024-11-11 22:55:25,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:25,679 INFO L276 IsEmpty]: Start isEmpty. Operand 12255 states and 18891 transitions. [2024-11-11 22:55:25,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:55:25,684 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:25,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:25,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 22:55:25,684 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:25,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:25,685 INFO L85 PathProgramCache]: Analyzing trace with hash -126446521, now seen corresponding path program 1 times [2024-11-11 22:55:25,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:25,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885388543] [2024-11-11 22:55:25,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:25,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:25,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:25,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:25,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:25,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:25,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:25,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:25,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:25,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885388543] [2024-11-11 22:55:25,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885388543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:25,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:25,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:25,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485782267] [2024-11-11 22:55:25,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:25,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:25,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:25,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:25,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:25,860 INFO L87 Difference]: Start difference. First operand 12255 states and 18891 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:30,715 INFO L93 Difference]: Finished difference Result 48995 states and 76354 transitions. [2024-11-11 22:55:30,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:55:30,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-11 22:55:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:30,809 INFO L225 Difference]: With dead ends: 48995 [2024-11-11 22:55:30,810 INFO L226 Difference]: Without dead ends: 36761 [2024-11-11 22:55:30,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:55:30,846 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 2012 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 3332 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2044 SdHoareTripleChecker+Valid, 2551 SdHoareTripleChecker+Invalid, 3398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:30,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2044 Valid, 2551 Invalid, 3398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3332 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 22:55:30,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36761 states. [2024-11-11 22:55:32,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36761 to 23969. [2024-11-11 22:55:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23969 states, 22176 states have (on average 1.519119769119769) internal successors, (33688), 22241 states have internal predecessors, (33688), 1338 states have call successors, (1338), 390 states have call predecessors, (1338), 454 states have return successors, (2131), 1401 states have call predecessors, (2131), 1338 states have call successors, (2131) [2024-11-11 22:55:32,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23969 states to 23969 states and 37157 transitions. [2024-11-11 22:55:32,527 INFO L78 Accepts]: Start accepts. Automaton has 23969 states and 37157 transitions. Word has length 178 [2024-11-11 22:55:32,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:32,528 INFO L471 AbstractCegarLoop]: Abstraction has 23969 states and 37157 transitions. [2024-11-11 22:55:32,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:32,528 INFO L276 IsEmpty]: Start isEmpty. Operand 23969 states and 37157 transitions. [2024-11-11 22:55:32,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:55:32,537 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:32,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:32,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 22:55:32,537 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:32,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:32,537 INFO L85 PathProgramCache]: Analyzing trace with hash -282427063, now seen corresponding path program 1 times [2024-11-11 22:55:32,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:32,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322236581] [2024-11-11 22:55:32,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:32,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:32,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:32,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:32,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:32,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:32,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:32,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:32,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322236581] [2024-11-11 22:55:32,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322236581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:32,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:32,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:32,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371224370] [2024-11-11 22:55:32,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:32,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:32,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:32,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:32,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:32,748 INFO L87 Difference]: Start difference. First operand 23969 states and 37157 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:40,174 INFO L93 Difference]: Finished difference Result 95395 states and 149450 transitions. [2024-11-11 22:55:40,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:55:40,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-11 22:55:40,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:40,445 INFO L225 Difference]: With dead ends: 95395 [2024-11-11 22:55:40,445 INFO L226 Difference]: Without dead ends: 71447 [2024-11-11 22:55:40,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:55:40,494 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 1668 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 4006 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1686 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 4071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:40,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1686 Valid, 2555 Invalid, 4071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4006 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 22:55:40,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71447 states. [2024-11-11 22:55:44,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71447 to 47522. [2024-11-11 22:55:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47522 states, 44033 states have (on average 1.5194513206004587) internal successors, (66906), 44162 states have internal predecessors, (66906), 2586 states have call successors, (2586), 774 states have call predecessors, (2586), 902 states have return successors, (4901), 2713 states have call predecessors, (4901), 2586 states have call successors, (4901) [2024-11-11 22:55:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47522 states to 47522 states and 74393 transitions. [2024-11-11 22:55:44,257 INFO L78 Accepts]: Start accepts. Automaton has 47522 states and 74393 transitions. Word has length 178 [2024-11-11 22:55:44,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:44,257 INFO L471 AbstractCegarLoop]: Abstraction has 47522 states and 74393 transitions. [2024-11-11 22:55:44,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 47522 states and 74393 transitions. [2024-11-11 22:55:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:55:44,273 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:44,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:44,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 22:55:44,273 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:44,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:44,274 INFO L85 PathProgramCache]: Analyzing trace with hash 128183303, now seen corresponding path program 1 times [2024-11-11 22:55:44,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:44,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860169705] [2024-11-11 22:55:44,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:44,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:44,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:44,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:44,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:44,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:44,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:44,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:44,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:44,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860169705] [2024-11-11 22:55:44,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860169705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:44,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:44,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:44,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831647383] [2024-11-11 22:55:44,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:44,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:44,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:44,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:44,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:44,475 INFO L87 Difference]: Start difference. First operand 47522 states and 74393 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:55,114 INFO L93 Difference]: Finished difference Result 187426 states and 296400 transitions. [2024-11-11 22:55:55,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:55:55,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2024-11-11 22:55:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:55,547 INFO L225 Difference]: With dead ends: 187426 [2024-11-11 22:55:55,547 INFO L226 Difference]: Without dead ends: 139925 [2024-11-11 22:55:55,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:55:55,677 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 1933 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 3307 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1965 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 3373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:55,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1965 Valid, 2555 Invalid, 3373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3307 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 22:55:55,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139925 states. [2024-11-11 22:56:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139925 to 94563. [2024-11-11 22:56:02,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94563 states, 87746 states have (on average 1.5203428076493515) internal successors, (133404), 88003 states have internal predecessors, (133404), 5018 states have call successors, (5018), 1542 states have call predecessors, (5018), 1798 states have return successors, (11835), 5273 states have call predecessors, (11835), 5018 states have call successors, (11835) [2024-11-11 22:56:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94563 states to 94563 states and 150257 transitions. [2024-11-11 22:56:03,056 INFO L78 Accepts]: Start accepts. Automaton has 94563 states and 150257 transitions. Word has length 178 [2024-11-11 22:56:03,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:03,056 INFO L471 AbstractCegarLoop]: Abstraction has 94563 states and 150257 transitions. [2024-11-11 22:56:03,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:03,057 INFO L276 IsEmpty]: Start isEmpty. Operand 94563 states and 150257 transitions. [2024-11-11 22:56:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 22:56:03,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:03,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:03,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 22:56:03,090 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:03,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:03,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1659686519, now seen corresponding path program 1 times [2024-11-11 22:56:03,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:03,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854415941] [2024-11-11 22:56:03,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:03,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:03,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:03,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:56:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:03,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:56:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:03,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:56:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:03,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:56:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:03,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:03,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854415941] [2024-11-11 22:56:03,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854415941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:03,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:03,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:03,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061053348] [2024-11-11 22:56:03,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:03,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:03,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:03,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:03,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:03,280 INFO L87 Difference]: Start difference. First operand 94563 states and 150257 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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)