./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-1.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'b5bbf318bd4a4e295f88f23f80bb9f32022c2eeb214e815b87206f6eafbbf272'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b5bbf318bd4a4e295f88f23f80bb9f32022c2eeb214e815b87206f6eafbbf272 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:42:22,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:42:22,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:42:22,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:42:22,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:42:22,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:42:22,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:42:22,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:42:22,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:42:22,657 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:42:22,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:42:22,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:42:22,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:42:22,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:42:22,658 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:42:22,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:42:22,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:42:22,658 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:42:22,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:42:22,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:42:22,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:42:22,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:42:22,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:42:22,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:42:22,659 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:42:22,659 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:42:22,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:42:22,659 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:42:22,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:42:22,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:42:22,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:42:22,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:42:22,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:42:22,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:42:22,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:42:22,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:42:22,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:42:22,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:42:22,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:42:22,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:42:22,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:42:22,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:42:22,660 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> b5bbf318bd4a4e295f88f23f80bb9f32022c2eeb214e815b87206f6eafbbf272 [2024-11-07 01:42:22,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:42:22,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:42:22,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:42:22,964 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:42:22,965 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:42:22,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-1.c [2024-11-07 01:42:24,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:42:24,649 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:42:24,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-1.c [2024-11-07 01:42:24,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82d1db7cf/7a9a822303ec4b9798b2d9ebf40ae4dc/FLAG41349f9ce [2024-11-07 01:42:24,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82d1db7cf/7a9a822303ec4b9798b2d9ebf40ae4dc [2024-11-07 01:42:24,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:42:24,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:42:24,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:42:24,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:42:24,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:42:24,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:42:24" (1/1) ... [2024-11-07 01:42:24,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eba4f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:24, skipping insertion in model container [2024-11-07 01:42:24,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:42:24" (1/1) ... [2024-11-07 01:42:24,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:42:24,906 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-1.c[913,926] [2024-11-07 01:42:24,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-1.c[5977,5990] [2024-11-07 01:42:25,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:42:25,072 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:42:25,083 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-1.c[913,926] [2024-11-07 01:42:25,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-1.c[5977,5990] [2024-11-07 01:42:25,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:42:25,152 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:42:25,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:25 WrapperNode [2024-11-07 01:42:25,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:42:25,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:42:25,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:42:25,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:42:25,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:25" (1/1) ... [2024-11-07 01:42:25,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:25" (1/1) ... [2024-11-07 01:42:25,234 INFO L138 Inliner]: procedures = 58, calls = 63, calls flagged for inlining = 33, calls inlined = 33, statements flattened = 663 [2024-11-07 01:42:25,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:42:25,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:42:25,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:42:25,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:42:25,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:25" (1/1) ... [2024-11-07 01:42:25,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:25" (1/1) ... [2024-11-07 01:42:25,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:25" (1/1) ... [2024-11-07 01:42:25,283 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-07 01:42:25,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:25" (1/1) ... [2024-11-07 01:42:25,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:25" (1/1) ... [2024-11-07 01:42:25,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:25" (1/1) ... [2024-11-07 01:42:25,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:25" (1/1) ... [2024-11-07 01:42:25,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:25" (1/1) ... [2024-11-07 01:42:25,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:25" (1/1) ... [2024-11-07 01:42:25,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:42:25,341 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:42:25,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:42:25,342 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:42:25,343 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:25" (1/1) ... [2024-11-07 01:42:25,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:42:25,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:42:25,383 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:42:25,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:42:25,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:42:25,412 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:42:25,412 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:42:25,412 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-07 01:42:25,413 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-07 01:42:25,413 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:42:25,413 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:42:25,413 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:42:25,413 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:42:25,413 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:42:25,413 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:42:25,414 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:42:25,414 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:42:25,414 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:42:25,414 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:42:25,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:42:25,414 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:42:25,414 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:42:25,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:42:25,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:42:25,414 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:42:25,415 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:42:25,529 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:42:25,531 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:42:26,246 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2024-11-07 01:42:26,247 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:42:26,270 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:42:26,270 INFO L316 CfgBuilder]: Removed 12 assume(true) statements. [2024-11-07 01:42:26,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:42:26 BoogieIcfgContainer [2024-11-07 01:42:26,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:42:26,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:42:26,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:42:26,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:42:26,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:42:24" (1/3) ... [2024-11-07 01:42:26,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282e945f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:42:26, skipping insertion in model container [2024-11-07 01:42:26,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:25" (2/3) ... [2024-11-07 01:42:26,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282e945f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:42:26, skipping insertion in model container [2024-11-07 01:42:26,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:42:26" (3/3) ... [2024-11-07 01:42:26,281 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.05.cil-1.c [2024-11-07 01:42:26,293 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:42:26,293 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:42:26,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:42:26,396 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;@c153393, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:42:26,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:42:26,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 285 states, 248 states have (on average 1.592741935483871) internal successors, (395), 253 states have internal predecessors, (395), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 01:42:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 01:42:26,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:26,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:26,413 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:26,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:26,419 INFO L85 PathProgramCache]: Analyzing trace with hash -755848238, now seen corresponding path program 1 times [2024-11-07 01:42:26,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:26,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317980859] [2024-11-07 01:42:26,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:26,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:26,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:26,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 01:42:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:26,731 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-07 01:42:26,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:26,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317980859] [2024-11-07 01:42:26,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317980859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:26,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:26,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:42:26,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304294947] [2024-11-07 01:42:26,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:26,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:26,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:26,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:26,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:42:26,767 INFO L87 Difference]: Start difference. First operand has 285 states, 248 states have (on average 1.592741935483871) internal successors, (395), 253 states have internal predecessors, (395), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) 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-07 01:42:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:27,265 INFO L93 Difference]: Finished difference Result 622 states and 972 transitions. [2024-11-07 01:42:27,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:42:27,267 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-07 01:42:27,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:27,280 INFO L225 Difference]: With dead ends: 622 [2024-11-07 01:42:27,282 INFO L226 Difference]: Without dead ends: 345 [2024-11-07 01:42:27,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:42:27,292 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 529 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:27,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 582 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:42:27,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-07 01:42:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 339. [2024-11-07 01:42:27,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 297 states have (on average 1.468013468013468) internal successors, (436), 301 states have internal predecessors, (436), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (33), 27 states have call predecessors, (33), 27 states have call successors, (33) [2024-11-07 01:42:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 498 transitions. [2024-11-07 01:42:27,373 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 498 transitions. Word has length 44 [2024-11-07 01:42:27,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:27,375 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 498 transitions. [2024-11-07 01:42:27,375 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-07 01:42:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 498 transitions. [2024-11-07 01:42:27,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-07 01:42:27,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:27,378 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:27,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:42:27,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:27,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:27,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1540596074, now seen corresponding path program 1 times [2024-11-07 01:42:27,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:27,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954328490] [2024-11-07 01:42:27,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:27,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:27,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:27,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 01:42:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:27,524 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-07 01:42:27,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:27,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954328490] [2024-11-07 01:42:27,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954328490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:27,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:27,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:42:27,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318034631] [2024-11-07 01:42:27,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:27,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:27,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:27,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:27,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:42:27,532 INFO L87 Difference]: Start difference. First operand 339 states and 498 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-07 01:42:27,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:27,982 INFO L93 Difference]: Finished difference Result 587 states and 838 transitions. [2024-11-07 01:42:27,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:42:27,982 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-07 01:42:27,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:27,986 INFO L225 Difference]: With dead ends: 587 [2024-11-07 01:42:27,986 INFO L226 Difference]: Without dead ends: 463 [2024-11-07 01:42:27,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:42:27,988 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 229 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:27,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 772 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:42:27,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-07 01:42:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 406. [2024-11-07 01:42:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 358 states have (on average 1.452513966480447) internal successors, (520), 362 states have internal predecessors, (520), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (36), 30 states have call predecessors, (36), 30 states have call successors, (36) [2024-11-07 01:42:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 588 transitions. [2024-11-07 01:42:28,040 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 588 transitions. Word has length 45 [2024-11-07 01:42:28,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:28,040 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 588 transitions. [2024-11-07 01:42:28,040 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-07 01:42:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 588 transitions. [2024-11-07 01:42:28,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-07 01:42:28,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:28,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:28,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:42:28,044 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:28,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:28,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1470013761, now seen corresponding path program 1 times [2024-11-07 01:42:28,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:28,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159848938] [2024-11-07 01:42:28,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:28,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:28,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:28,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 01:42:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:28,129 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-07 01:42:28,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:28,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159848938] [2024-11-07 01:42:28,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159848938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:28,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:28,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:42:28,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143919682] [2024-11-07 01:42:28,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:28,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:28,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:28,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:28,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:42:28,135 INFO L87 Difference]: Start difference. First operand 406 states and 588 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-07 01:42:28,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:28,480 INFO L93 Difference]: Finished difference Result 814 states and 1147 transitions. [2024-11-07 01:42:28,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:42:28,480 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-07 01:42:28,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:28,496 INFO L225 Difference]: With dead ends: 814 [2024-11-07 01:42:28,497 INFO L226 Difference]: Without dead ends: 623 [2024-11-07 01:42:28,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:42:28,498 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 539 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:28,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 575 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:42:28,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-07 01:42:28,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 571. [2024-11-07 01:42:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 504 states have (on average 1.4087301587301588) internal successors, (710), 511 states have internal predecessors, (710), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (53), 39 states have call predecessors, (53), 41 states have call successors, (53) [2024-11-07 01:42:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 806 transitions. [2024-11-07 01:42:28,548 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 806 transitions. Word has length 45 [2024-11-07 01:42:28,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:28,549 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 806 transitions. [2024-11-07 01:42:28,549 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-07 01:42:28,549 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 806 transitions. [2024-11-07 01:42:28,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-07 01:42:28,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:28,552 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:28,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:42:28,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:28,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:28,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1444915554, now seen corresponding path program 1 times [2024-11-07 01:42:28,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:28,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465888251] [2024-11-07 01:42:28,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:28,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:28,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:28,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:42:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:28,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 01:42:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:28,665 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-07 01:42:28,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:28,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465888251] [2024-11-07 01:42:28,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465888251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:28,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:28,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:42:28,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114205073] [2024-11-07 01:42:28,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:28,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:28,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:28,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:28,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:42:28,667 INFO L87 Difference]: Start difference. First operand 571 states and 806 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-07 01:42:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:29,041 INFO L93 Difference]: Finished difference Result 1155 states and 1591 transitions. [2024-11-07 01:42:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:42:29,042 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-07 01:42:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:29,050 INFO L225 Difference]: With dead ends: 1155 [2024-11-07 01:42:29,051 INFO L226 Difference]: Without dead ends: 799 [2024-11-07 01:42:29,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:42:29,055 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 213 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:29,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 825 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:42:29,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-11-07 01:42:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 761. [2024-11-07 01:42:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 670 states have (on average 1.3582089552238805) internal successors, (910), 679 states have internal predecessors, (910), 57 states have call successors, (57), 29 states have call predecessors, (57), 32 states have return successors, (77), 53 states have call predecessors, (77), 55 states have call successors, (77) [2024-11-07 01:42:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1044 transitions. [2024-11-07 01:42:29,120 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1044 transitions. Word has length 62 [2024-11-07 01:42:29,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:29,121 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1044 transitions. [2024-11-07 01:42:29,121 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-07 01:42:29,121 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1044 transitions. [2024-11-07 01:42:29,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 01:42:29,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:29,125 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:29,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:42:29,125 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:29,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:29,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1696333881, now seen corresponding path program 1 times [2024-11-07 01:42:29,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:29,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354935705] [2024-11-07 01:42:29,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:29,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:29,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:29,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:42:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:29,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:42:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:29,217 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-07 01:42:29,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:29,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354935705] [2024-11-07 01:42:29,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354935705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:29,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:29,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:42:29,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968838843] [2024-11-07 01:42:29,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:29,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:29,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:29,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:29,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:42:29,218 INFO L87 Difference]: Start difference. First operand 761 states and 1044 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-07 01:42:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:29,549 INFO L93 Difference]: Finished difference Result 1414 states and 1897 transitions. [2024-11-07 01:42:29,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:42:29,549 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-07 01:42:29,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:29,561 INFO L225 Difference]: With dead ends: 1414 [2024-11-07 01:42:29,561 INFO L226 Difference]: Without dead ends: 960 [2024-11-07 01:42:29,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:42:29,566 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 526 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:29,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 574 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:42:29,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-07 01:42:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 905. [2024-11-07 01:42:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 798 states have (on average 1.3295739348370927) internal successors, (1061), 809 states have internal predecessors, (1061), 65 states have call successors, (65), 35 states have call predecessors, (65), 40 states have return successors, (91), 61 states have call predecessors, (91), 63 states have call successors, (91) [2024-11-07 01:42:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1217 transitions. [2024-11-07 01:42:29,634 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1217 transitions. Word has length 67 [2024-11-07 01:42:29,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:29,635 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1217 transitions. [2024-11-07 01:42:29,635 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-07 01:42:29,635 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1217 transitions. [2024-11-07 01:42:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:29,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:29,639 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:29,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:42:29,639 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:29,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:29,639 INFO L85 PathProgramCache]: Analyzing trace with hash -343902925, now seen corresponding path program 1 times [2024-11-07 01:42:29,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:29,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873786954] [2024-11-07 01:42:29,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:29,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:29,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:29,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:42:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:29,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:42:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:29,795 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-07 01:42:29,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:29,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873786954] [2024-11-07 01:42:29,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873786954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:42:29,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142894656] [2024-11-07 01:42:29,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:29,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:29,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:42:29,798 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:42:29,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 01:42:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:29,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 01:42:29,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:42:30,025 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-07 01:42:30,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:42:30,077 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-07 01:42:30,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142894656] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 01:42:30,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 01:42:30,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2024-11-07 01:42:30,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504054793] [2024-11-07 01:42:30,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:30,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:30,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:30,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:30,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:42:30,084 INFO L87 Difference]: Start difference. First operand 905 states and 1217 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-07 01:42:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:30,237 INFO L93 Difference]: Finished difference Result 961 states and 1285 transitions. [2024-11-07 01:42:30,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:42:30,238 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-07 01:42:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:30,244 INFO L225 Difference]: With dead ends: 961 [2024-11-07 01:42:30,244 INFO L226 Difference]: Without dead ends: 958 [2024-11-07 01:42:30,245 INFO L431 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-07 01:42:30,248 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 725 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:30,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 498 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:42:30,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-11-07 01:42:30,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 904. [2024-11-07 01:42:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 798 states have (on average 1.3270676691729324) internal successors, (1059), 808 states have internal predecessors, (1059), 64 states have call successors, (64), 35 states have call predecessors, (64), 40 states have return successors, (91), 61 states have call predecessors, (91), 63 states have call successors, (91) [2024-11-07 01:42:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1214 transitions. [2024-11-07 01:42:30,322 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1214 transitions. Word has length 68 [2024-11-07 01:42:30,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:30,322 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1214 transitions. [2024-11-07 01:42:30,322 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-07 01:42:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1214 transitions. [2024-11-07 01:42:30,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 01:42:30,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:30,327 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:30,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 01:42:30,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:30,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:30,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:30,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2071941380, now seen corresponding path program 1 times [2024-11-07 01:42:30,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:30,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545811114] [2024-11-07 01:42:30,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:30,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:30,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:30,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:42:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:30,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:42:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:30,655 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-07 01:42:30,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:30,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545811114] [2024-11-07 01:42:30,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545811114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:42:30,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218569393] [2024-11-07 01:42:30,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:30,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:30,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:42:30,664 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:42:30,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 01:42:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:30,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 01:42:30,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:42:31,022 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-07 01:42:31,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:42:31,125 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-07 01:42:31,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218569393] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:42:31,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:42:31,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2024-11-07 01:42:31,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964832336] [2024-11-07 01:42:31,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:42:31,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 01:42:31,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:31,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 01:42:31,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:42:31,130 INFO L87 Difference]: Start difference. First operand 904 states and 1214 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-07 01:42:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:32,297 INFO L93 Difference]: Finished difference Result 2411 states and 3202 transitions. [2024-11-07 01:42:32,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 01:42:32,298 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-07 01:42:32,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:32,307 INFO L225 Difference]: With dead ends: 2411 [2024-11-07 01:42:32,307 INFO L226 Difference]: Without dead ends: 1867 [2024-11-07 01:42:32,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-07 01:42:32,311 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 1049 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:32,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 2365 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:42:32,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2024-11-07 01:42:32,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1267. [2024-11-07 01:42:32,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 1122 states have (on average 1.3003565062388591) internal successors, (1459), 1140 states have internal predecessors, (1459), 84 states have call successors, (84), 49 states have call predecessors, (84), 59 states have return successors, (125), 78 states have call predecessors, (125), 83 states have call successors, (125) [2024-11-07 01:42:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1668 transitions. [2024-11-07 01:42:32,390 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1668 transitions. Word has length 69 [2024-11-07 01:42:32,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:32,391 INFO L471 AbstractCegarLoop]: Abstraction has 1267 states and 1668 transitions. [2024-11-07 01:42:32,391 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-07 01:42:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1668 transitions. [2024-11-07 01:42:32,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 01:42:32,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:32,395 INFO L215 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-07 01:42:32,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 01:42:32,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:32,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:32,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:32,597 INFO L85 PathProgramCache]: Analyzing trace with hash -962917584, now seen corresponding path program 1 times [2024-11-07 01:42:32,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:32,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162666958] [2024-11-07 01:42:32,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:32,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:32,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:32,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:42:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:32,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 01:42:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:32,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 01:42:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:32,757 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-07 01:42:32,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:32,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162666958] [2024-11-07 01:42:32,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162666958] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:42:32,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460084280] [2024-11-07 01:42:32,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:32,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:32,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:42:32,763 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:42:32,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 01:42:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:32,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 01:42:32,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:42:32,919 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-07 01:42:32,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:42:32,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460084280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:32,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:42:32,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-07 01:42:32,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781723803] [2024-11-07 01:42:32,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:32,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:42:32,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:32,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:42:32,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:32,922 INFO L87 Difference]: Start difference. First operand 1267 states and 1668 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-07 01:42:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:32,979 INFO L93 Difference]: Finished difference Result 1964 states and 2572 transitions. [2024-11-07 01:42:32,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:42:32,979 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-07 01:42:32,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:32,987 INFO L225 Difference]: With dead ends: 1964 [2024-11-07 01:42:32,987 INFO L226 Difference]: Without dead ends: 1145 [2024-11-07 01:42:32,990 INFO L431 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-07 01:42:32,991 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 367 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 512 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-07 01:42:32,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 512 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:42:32,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2024-11-07 01:42:33,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1130. [2024-11-07 01:42:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1001 states have (on average 1.2997002997002998) internal successors, (1301), 1018 states have internal predecessors, (1301), 76 states have call successors, (76), 43 states have call predecessors, (76), 51 states have return successors, (111), 69 states have call predecessors, (111), 75 states have call successors, (111) [2024-11-07 01:42:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1488 transitions. [2024-11-07 01:42:33,055 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1488 transitions. Word has length 88 [2024-11-07 01:42:33,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:33,056 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1488 transitions. [2024-11-07 01:42:33,056 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-07 01:42:33,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1488 transitions. [2024-11-07 01:42:33,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:42:33,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:33,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:33,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 01:42:33,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:33,267 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:33,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:33,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1627073702, now seen corresponding path program 1 times [2024-11-07 01:42:33,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:33,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967763302] [2024-11-07 01:42:33,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:33,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:33,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:33,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:42:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:33,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:42:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:33,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:42:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:33,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:42:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:33,447 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-07 01:42:33,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:33,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967763302] [2024-11-07 01:42:33,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967763302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:33,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:33,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:42:33,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668168136] [2024-11-07 01:42:33,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:33,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:42:33,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:33,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:42:33,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:42:33,449 INFO L87 Difference]: Start difference. First operand 1130 states and 1488 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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-07 01:42:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:34,970 INFO L93 Difference]: Finished difference Result 1654 states and 2307 transitions. [2024-11-07 01:42:34,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:42:34,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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 101 [2024-11-07 01:42:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:34,978 INFO L225 Difference]: With dead ends: 1654 [2024-11-07 01:42:34,978 INFO L226 Difference]: Without dead ends: 1459 [2024-11-07 01:42:34,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:42:34,980 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 907 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:34,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 996 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:42:34,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2024-11-07 01:42:35,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1330. [2024-11-07 01:42:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1180 states have (on average 1.335593220338983) internal successors, (1576), 1198 states have internal predecessors, (1576), 90 states have call successors, (90), 49 states have call predecessors, (90), 58 states have return successors, (128), 83 states have call predecessors, (128), 89 states have call successors, (128) [2024-11-07 01:42:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1794 transitions. [2024-11-07 01:42:35,091 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1794 transitions. Word has length 101 [2024-11-07 01:42:35,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:35,091 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1794 transitions. [2024-11-07 01:42:35,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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-07 01:42:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1794 transitions. [2024-11-07 01:42:35,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:42:35,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:35,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:35,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:42:35,095 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:35,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:35,096 INFO L85 PathProgramCache]: Analyzing trace with hash -89810902, now seen corresponding path program 1 times [2024-11-07 01:42:35,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:35,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084330772] [2024-11-07 01:42:35,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:35,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:35,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:35,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:42:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:35,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:42:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:35,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:42:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:35,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:42:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:35,291 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-07 01:42:35,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:35,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084330772] [2024-11-07 01:42:35,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084330772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:35,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:35,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:35,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528872189] [2024-11-07 01:42:35,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:35,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:35,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:35,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:35,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:35,293 INFO L87 Difference]: Start difference. First operand 1330 states and 1794 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:37,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:37,214 INFO L93 Difference]: Finished difference Result 2124 states and 3030 transitions. [2024-11-07 01:42:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:42:37,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:42:37,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:37,222 INFO L225 Difference]: With dead ends: 2124 [2024-11-07 01:42:37,223 INFO L226 Difference]: Without dead ends: 1729 [2024-11-07 01:42:37,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:42:37,225 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 922 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 1860 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:37,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1615 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1860 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:42:37,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2024-11-07 01:42:37,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1517. [2024-11-07 01:42:37,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1346 states have (on average 1.3558692421991085) internal successors, (1825), 1365 states have internal predecessors, (1825), 104 states have call successors, (104), 55 states have call predecessors, (104), 65 states have return successors, (144), 98 states have call predecessors, (144), 103 states have call successors, (144) [2024-11-07 01:42:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 2073 transitions. [2024-11-07 01:42:37,340 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 2073 transitions. Word has length 101 [2024-11-07 01:42:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:37,340 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 2073 transitions. [2024-11-07 01:42:37,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 2073 transitions. [2024-11-07 01:42:37,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:42:37,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:37,345 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:37,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:42:37,345 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:37,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:37,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1968941848, now seen corresponding path program 1 times [2024-11-07 01:42:37,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:37,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86420449] [2024-11-07 01:42:37,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:37,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:37,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:37,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:42:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:37,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:42:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:37,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:42:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:37,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:42:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:37,532 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-07 01:42:37,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:37,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86420449] [2024-11-07 01:42:37,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86420449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:37,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:37,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:37,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048560083] [2024-11-07 01:42:37,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:37,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:37,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:37,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:37,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:37,534 INFO L87 Difference]: Start difference. First operand 1517 states and 2073 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:38,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:38,441 INFO L93 Difference]: Finished difference Result 2315 states and 3323 transitions. [2024-11-07 01:42:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:42:38,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:42:38,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:38,450 INFO L225 Difference]: With dead ends: 2315 [2024-11-07 01:42:38,450 INFO L226 Difference]: Without dead ends: 1733 [2024-11-07 01:42:38,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:42:38,454 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 826 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:38,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 782 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:42:38,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2024-11-07 01:42:38,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1517. [2024-11-07 01:42:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1346 states have (on average 1.3536404160475484) internal successors, (1822), 1365 states have internal predecessors, (1822), 104 states have call successors, (104), 55 states have call predecessors, (104), 65 states have return successors, (144), 98 states have call predecessors, (144), 103 states have call successors, (144) [2024-11-07 01:42:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 2070 transitions. [2024-11-07 01:42:38,576 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 2070 transitions. Word has length 101 [2024-11-07 01:42:38,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:38,576 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 2070 transitions. [2024-11-07 01:42:38,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 2070 transitions. [2024-11-07 01:42:38,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:42:38,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:38,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:38,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:42:38,581 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:38,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:38,582 INFO L85 PathProgramCache]: Analyzing trace with hash -402183898, now seen corresponding path program 1 times [2024-11-07 01:42:38,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:38,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896898344] [2024-11-07 01:42:38,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:38,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:38,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:38,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:42:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:38,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:42:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:38,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:42:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:38,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:42:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:38,777 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-07 01:42:38,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:38,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896898344] [2024-11-07 01:42:38,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896898344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:38,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:38,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:38,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722149269] [2024-11-07 01:42:38,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:38,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:38,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:38,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:38,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:38,780 INFO L87 Difference]: Start difference. First operand 1517 states and 2070 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:40,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:40,363 INFO L93 Difference]: Finished difference Result 2811 states and 4067 transitions. [2024-11-07 01:42:40,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:42:40,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:42:40,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:40,374 INFO L225 Difference]: With dead ends: 2811 [2024-11-07 01:42:40,374 INFO L226 Difference]: Without dead ends: 2229 [2024-11-07 01:42:40,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:42:40,376 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 909 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 1814 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:40,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 1613 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1814 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:42:40,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2024-11-07 01:42:40,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 1898. [2024-11-07 01:42:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1685 states have (on average 1.3821958456973293) internal successors, (2329), 1706 states have internal predecessors, (2329), 132 states have call successors, (132), 67 states have call predecessors, (132), 79 states have return successors, (180), 128 states have call predecessors, (180), 131 states have call successors, (180) [2024-11-07 01:42:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2641 transitions. [2024-11-07 01:42:40,567 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2641 transitions. Word has length 101 [2024-11-07 01:42:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:40,567 INFO L471 AbstractCegarLoop]: Abstraction has 1898 states and 2641 transitions. [2024-11-07 01:42:40,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2641 transitions. [2024-11-07 01:42:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:42:40,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:40,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:40,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:42:40,572 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:40,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:40,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1460021976, now seen corresponding path program 1 times [2024-11-07 01:42:40,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:40,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704214704] [2024-11-07 01:42:40,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:40,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:40,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:40,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:42:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:40,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:42:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:40,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:42:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:40,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:42:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:40,756 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-07 01:42:40,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:40,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704214704] [2024-11-07 01:42:40,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704214704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:40,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:40,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:40,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375001239] [2024-11-07 01:42:40,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:40,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:40,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:40,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:40,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:40,760 INFO L87 Difference]: Start difference. First operand 1898 states and 2641 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:42,303 INFO L93 Difference]: Finished difference Result 4152 states and 6102 transitions. [2024-11-07 01:42:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:42:42,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:42:42,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:42,320 INFO L225 Difference]: With dead ends: 4152 [2024-11-07 01:42:42,320 INFO L226 Difference]: Without dead ends: 3189 [2024-11-07 01:42:42,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:42:42,325 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 908 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:42,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1613 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:42:42,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2024-11-07 01:42:42,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 2659. [2024-11-07 01:42:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2659 states, 2362 states have (on average 1.413632514817951) internal successors, (3339), 2387 states have internal predecessors, (3339), 188 states have call successors, (188), 91 states have call predecessors, (188), 107 states have return successors, (258), 188 states have call predecessors, (258), 187 states have call successors, (258) [2024-11-07 01:42:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2659 states to 2659 states and 3785 transitions. [2024-11-07 01:42:42,542 INFO L78 Accepts]: Start accepts. Automaton has 2659 states and 3785 transitions. Word has length 101 [2024-11-07 01:42:42,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:42,542 INFO L471 AbstractCegarLoop]: Abstraction has 2659 states and 3785 transitions. [2024-11-07 01:42:42,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:42,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 3785 transitions. [2024-11-07 01:42:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:42:42,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:42,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:42,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:42:42,549 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:42,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:42,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1692442854, now seen corresponding path program 1 times [2024-11-07 01:42:42,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:42,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54678661] [2024-11-07 01:42:42,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:42,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:42,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:42,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:42:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:42,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:42:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:42,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:42:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:42,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:42:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:42:42,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:42,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54678661] [2024-11-07 01:42:42,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54678661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:42,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:42,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:42,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36951399] [2024-11-07 01:42:42,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:42,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:42,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:42,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:42,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:42,745 INFO L87 Difference]: Start difference. First operand 2659 states and 3785 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:44,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:44,689 INFO L93 Difference]: Finished difference Result 7463 states and 11130 transitions. [2024-11-07 01:42:44,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:42:44,690 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:42:44,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:44,714 INFO L225 Difference]: With dead ends: 7463 [2024-11-07 01:42:44,715 INFO L226 Difference]: Without dead ends: 5739 [2024-11-07 01:42:44,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:42:44,721 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 1008 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:44,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 1151 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1901 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:42:44,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5739 states. [2024-11-07 01:42:45,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5739 to 4164. [2024-11-07 01:42:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4164 states, 3707 states have (on average 1.4440248179120583) internal successors, (5353), 3740 states have internal predecessors, (5353), 292 states have call successors, (292), 139 states have call predecessors, (292), 163 states have return successors, (424), 300 states have call predecessors, (424), 291 states have call successors, (424) [2024-11-07 01:42:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 6069 transitions. [2024-11-07 01:42:45,049 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 6069 transitions. Word has length 101 [2024-11-07 01:42:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:45,050 INFO L471 AbstractCegarLoop]: Abstraction has 4164 states and 6069 transitions. [2024-11-07 01:42:45,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 6069 transitions. [2024-11-07 01:42:45,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:42:45,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:45,056 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:45,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:42:45,056 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:45,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:45,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1932682600, now seen corresponding path program 1 times [2024-11-07 01:42:45,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:45,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470917764] [2024-11-07 01:42:45,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:45,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:45,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:45,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:42:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:45,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:42:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:45,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:42:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:45,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:42:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:45,204 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-07 01:42:45,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:45,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470917764] [2024-11-07 01:42:45,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470917764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:45,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:45,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:45,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307366206] [2024-11-07 01:42:45,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:45,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:45,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:45,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:45,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:45,208 INFO L87 Difference]: Start difference. First operand 4164 states and 6069 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:46,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:46,341 INFO L93 Difference]: Finished difference Result 8329 states and 12528 transitions. [2024-11-07 01:42:46,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:42:46,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:42:46,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:46,362 INFO L225 Difference]: With dead ends: 8329 [2024-11-07 01:42:46,362 INFO L226 Difference]: Without dead ends: 5100 [2024-11-07 01:42:46,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:42:46,372 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 714 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:46,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 943 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:42:46,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5100 states. [2024-11-07 01:42:46,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5100 to 4164. [2024-11-07 01:42:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4164 states, 3707 states have (on average 1.4394388993795522) internal successors, (5336), 3740 states have internal predecessors, (5336), 292 states have call successors, (292), 139 states have call predecessors, (292), 163 states have return successors, (424), 300 states have call predecessors, (424), 291 states have call successors, (424) [2024-11-07 01:42:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 6052 transitions. [2024-11-07 01:42:46,709 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 6052 transitions. Word has length 101 [2024-11-07 01:42:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:46,710 INFO L471 AbstractCegarLoop]: Abstraction has 4164 states and 6052 transitions. [2024-11-07 01:42:46,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 6052 transitions. [2024-11-07 01:42:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:42:46,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:46,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:46,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:42:46,716 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:46,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:46,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1523251034, now seen corresponding path program 1 times [2024-11-07 01:42:46,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:46,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024103469] [2024-11-07 01:42:46,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:46,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:46,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:46,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:42:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:46,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:42:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:46,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:42:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:46,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:42:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:46,862 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-07 01:42:46,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:46,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024103469] [2024-11-07 01:42:46,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024103469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:46,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:46,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:46,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117540781] [2024-11-07 01:42:46,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:46,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:46,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:46,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:46,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:46,863 INFO L87 Difference]: Start difference. First operand 4164 states and 6052 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:47,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:47,868 INFO L93 Difference]: Finished difference Result 8311 states and 12441 transitions. [2024-11-07 01:42:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:42:47,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:42:47,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:47,886 INFO L225 Difference]: With dead ends: 8311 [2024-11-07 01:42:47,886 INFO L226 Difference]: Without dead ends: 5082 [2024-11-07 01:42:47,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:42:47,893 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 823 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:47,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 780 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:42:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5082 states. [2024-11-07 01:42:48,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5082 to 4164. [2024-11-07 01:42:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4164 states, 3707 states have (on average 1.434852980847046) internal successors, (5319), 3740 states have internal predecessors, (5319), 292 states have call successors, (292), 139 states have call predecessors, (292), 163 states have return successors, (424), 300 states have call predecessors, (424), 291 states have call successors, (424) [2024-11-07 01:42:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 6035 transitions. [2024-11-07 01:42:48,235 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 6035 transitions. Word has length 101 [2024-11-07 01:42:48,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:48,235 INFO L471 AbstractCegarLoop]: Abstraction has 4164 states and 6035 transitions. [2024-11-07 01:42:48,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:48,236 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 6035 transitions. [2024-11-07 01:42:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:42:48,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:48,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:48,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:42:48,243 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:48,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:48,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1496185432, now seen corresponding path program 1 times [2024-11-07 01:42:48,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:48,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39847197] [2024-11-07 01:42:48,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:48,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:48,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:48,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:42:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:48,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:42:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:48,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:42:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:48,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:42:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:48,415 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-07 01:42:48,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:48,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39847197] [2024-11-07 01:42:48,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39847197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:48,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:48,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:48,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181814435] [2024-11-07 01:42:48,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:48,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:48,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:48,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:48,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:48,418 INFO L87 Difference]: Start difference. First operand 4164 states and 6035 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:50,305 INFO L93 Difference]: Finished difference Result 12722 states and 19036 transitions. [2024-11-07 01:42:50,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:42:50,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:42:50,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:50,338 INFO L225 Difference]: With dead ends: 12722 [2024-11-07 01:42:50,338 INFO L226 Difference]: Without dead ends: 9493 [2024-11-07 01:42:50,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:42:50,350 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 994 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:50,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 1603 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:42:50,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9493 states. [2024-11-07 01:42:50,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9493 to 7199. [2024-11-07 01:42:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7199 states, 6430 states have (on average 1.4552099533437013) internal successors, (9357), 6479 states have internal predecessors, (9357), 492 states have call successors, (492), 235 states have call predecessors, (492), 275 states have return successors, (802), 516 states have call predecessors, (802), 491 states have call successors, (802) [2024-11-07 01:42:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7199 states to 7199 states and 10651 transitions. [2024-11-07 01:42:50,846 INFO L78 Accepts]: Start accepts. Automaton has 7199 states and 10651 transitions. Word has length 101 [2024-11-07 01:42:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:50,847 INFO L471 AbstractCegarLoop]: Abstraction has 7199 states and 10651 transitions. [2024-11-07 01:42:50,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 7199 states and 10651 transitions. [2024-11-07 01:42:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:42:50,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:50,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:50,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:42:50,855 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:50,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:50,856 INFO L85 PathProgramCache]: Analyzing trace with hash 721444966, now seen corresponding path program 1 times [2024-11-07 01:42:50,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:50,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453448107] [2024-11-07 01:42:50,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:50,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:50,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:50,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:42:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:50,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:42:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:42:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:42:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,006 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-07 01:42:51,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:51,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453448107] [2024-11-07 01:42:51,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453448107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:51,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:51,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:51,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442042341] [2024-11-07 01:42:51,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:51,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:51,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:51,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:51,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:51,008 INFO L87 Difference]: Start difference. First operand 7199 states and 10651 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:53,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:53,521 INFO L93 Difference]: Finished difference Result 22937 states and 34754 transitions. [2024-11-07 01:42:53,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:42:53,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:42:53,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:53,581 INFO L225 Difference]: With dead ends: 22937 [2024-11-07 01:42:53,581 INFO L226 Difference]: Without dead ends: 16673 [2024-11-07 01:42:53,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:42:53,603 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 908 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:53,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 1603 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:42:53,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16673 states. [2024-11-07 01:42:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16673 to 13281. [2024-11-07 01:42:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13281 states, 11904 states have (on average 1.4705141129032258) internal successors, (17505), 11985 states have internal predecessors, (17505), 876 states have call successors, (876), 427 states have call predecessors, (876), 499 states have return successors, (1704), 932 states have call predecessors, (1704), 875 states have call successors, (1704) [2024-11-07 01:42:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13281 states to 13281 states and 20085 transitions. [2024-11-07 01:42:54,722 INFO L78 Accepts]: Start accepts. Automaton has 13281 states and 20085 transitions. Word has length 101 [2024-11-07 01:42:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:54,723 INFO L471 AbstractCegarLoop]: Abstraction has 13281 states and 20085 transitions. [2024-11-07 01:42:54,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 13281 states and 20085 transitions. [2024-11-07 01:42:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:42:54,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:54,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:54,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:42:54,737 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:54,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:54,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1608667812, now seen corresponding path program 1 times [2024-11-07 01:42:54,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:54,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661093242] [2024-11-07 01:42:54,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:54,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:54,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:54,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:42:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:54,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:42:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:54,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:42:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:54,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:42:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:54,900 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-07 01:42:54,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:54,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661093242] [2024-11-07 01:42:54,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661093242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:54,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:54,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:54,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137872062] [2024-11-07 01:42:54,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:54,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:54,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:54,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:54,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:54,904 INFO L87 Difference]: Start difference. First operand 13281 states and 20085 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:56,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:56,719 INFO L93 Difference]: Finished difference Result 28649 states and 43882 transitions. [2024-11-07 01:42:56,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 01:42:56,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:42:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:56,787 INFO L225 Difference]: With dead ends: 28649 [2024-11-07 01:42:56,787 INFO L226 Difference]: Without dead ends: 16304 [2024-11-07 01:42:56,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:42:56,830 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 314 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:56,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1256 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:42:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16304 states. [2024-11-07 01:42:57,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16304 to 13476. [2024-11-07 01:42:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13476 states, 12099 states have (on average 1.462930820728986) internal successors, (17700), 12180 states have internal predecessors, (17700), 876 states have call successors, (876), 427 states have call predecessors, (876), 499 states have return successors, (1704), 932 states have call predecessors, (1704), 875 states have call successors, (1704) [2024-11-07 01:42:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13476 states to 13476 states and 20280 transitions. [2024-11-07 01:42:57,988 INFO L78 Accepts]: Start accepts. Automaton has 13476 states and 20280 transitions. Word has length 101 [2024-11-07 01:42:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:57,990 INFO L471 AbstractCegarLoop]: Abstraction has 13476 states and 20280 transitions. [2024-11-07 01:42:57,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:42:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 13476 states and 20280 transitions. [2024-11-07 01:42:58,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:42:58,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:58,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:58,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 01:42:58,001 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:58,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:58,002 INFO L85 PathProgramCache]: Analyzing trace with hash -77512026, now seen corresponding path program 1 times [2024-11-07 01:42:58,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:58,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781625713] [2024-11-07 01:42:58,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:58,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:58,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:58,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:42:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:58,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:42:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:58,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:42:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:58,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:42:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:58,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-07 01:42:58,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:58,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781625713] [2024-11-07 01:42:58,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781625713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:58,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:58,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:42:58,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305430222] [2024-11-07 01:42:58,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:58,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:42:58,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:58,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:42:58,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:42:58,125 INFO L87 Difference]: Start difference. First operand 13476 states and 20280 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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-07 01:43:01,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:43:01,841 INFO L93 Difference]: Finished difference Result 43821 states and 66535 transitions. [2024-11-07 01:43:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:43:01,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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 101 [2024-11-07 01:43:01,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:43:01,974 INFO L225 Difference]: With dead ends: 43821 [2024-11-07 01:43:01,974 INFO L226 Difference]: Without dead ends: 31281 [2024-11-07 01:43:02,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:43:02,014 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 1164 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:43:02,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 1238 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:43:02,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31281 states. [2024-11-07 01:43:03,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31281 to 25558. [2024-11-07 01:43:03,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25558 states, 22977 states have (on average 1.4669887278582932) internal successors, (33707), 23122 states have internal predecessors, (33707), 1626 states have call successors, (1626), 817 states have call predecessors, (1626), 953 states have return successors, (3184), 1682 states have call predecessors, (3184), 1625 states have call successors, (3184) [2024-11-07 01:43:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25558 states to 25558 states and 38517 transitions. [2024-11-07 01:43:03,628 INFO L78 Accepts]: Start accepts. Automaton has 25558 states and 38517 transitions. Word has length 101 [2024-11-07 01:43:03,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:43:03,629 INFO L471 AbstractCegarLoop]: Abstraction has 25558 states and 38517 transitions. [2024-11-07 01:43:03,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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-07 01:43:03,629 INFO L276 IsEmpty]: Start isEmpty. Operand 25558 states and 38517 transitions. [2024-11-07 01:43:03,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:43:03,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:43:03,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:43:03,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 01:43:03,641 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:43:03,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:43:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash 499416615, now seen corresponding path program 1 times [2024-11-07 01:43:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:43:03,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483497381] [2024-11-07 01:43:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:43:03,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:43:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:03,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:43:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:03,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:43:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:03,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:43:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:03,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:43:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:03,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:43:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:03,769 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-07 01:43:03,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:43:03,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483497381] [2024-11-07 01:43:03,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483497381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:43:03,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:43:03,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:43:03,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471415697] [2024-11-07 01:43:03,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:43:03,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:43:03,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:43:03,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:43:03,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:43:03,771 INFO L87 Difference]: Start difference. First operand 25558 states and 38517 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:43:06,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:43:06,376 INFO L93 Difference]: Finished difference Result 56161 states and 85326 transitions. [2024-11-07 01:43:06,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:43:06,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:43:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:43:06,521 INFO L225 Difference]: With dead ends: 56161 [2024-11-07 01:43:06,521 INFO L226 Difference]: Without dead ends: 31539 [2024-11-07 01:43:06,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 01:43:06,594 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 327 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:43:06,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1256 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:43:06,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31539 states. [2024-11-07 01:43:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31539 to 25753. [2024-11-07 01:43:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25753 states, 23172 states have (on average 1.460253754531331) internal successors, (33837), 23317 states have internal predecessors, (33837), 1626 states have call successors, (1626), 817 states have call predecessors, (1626), 953 states have return successors, (3184), 1682 states have call predecessors, (3184), 1625 states have call successors, (3184) [2024-11-07 01:43:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25753 states to 25753 states and 38647 transitions. [2024-11-07 01:43:08,799 INFO L78 Accepts]: Start accepts. Automaton has 25753 states and 38647 transitions. Word has length 101 [2024-11-07 01:43:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:43:08,799 INFO L471 AbstractCegarLoop]: Abstraction has 25753 states and 38647 transitions. [2024-11-07 01:43:08,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:43:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 25753 states and 38647 transitions. [2024-11-07 01:43:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:43:08,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:43:08,807 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:43:08,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 01:43:08,807 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:43:08,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:43:08,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1060116393, now seen corresponding path program 1 times [2024-11-07 01:43:08,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:43:08,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897453160] [2024-11-07 01:43:08,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:43:08,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:43:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:08,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:43:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:08,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:43:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:08,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:43:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:08,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:43:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:08,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:43:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:08,938 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-07 01:43:08,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:43:08,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897453160] [2024-11-07 01:43:08,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897453160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:43:08,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:43:08,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:43:08,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091423303] [2024-11-07 01:43:08,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:43:08,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:43:08,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:43:08,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:43:08,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:43:08,940 INFO L87 Difference]: Start difference. First operand 25753 states and 38647 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:43:11,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:43:11,498 INFO L93 Difference]: Finished difference Result 57136 states and 86236 transitions. [2024-11-07 01:43:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:43:11,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:43:11,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:43:11,609 INFO L225 Difference]: With dead ends: 57136 [2024-11-07 01:43:11,609 INFO L226 Difference]: Without dead ends: 32319 [2024-11-07 01:43:11,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 01:43:11,669 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 337 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:43:11,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1256 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:43:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32319 states. [2024-11-07 01:43:13,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32319 to 26143. [2024-11-07 01:43:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26143 states, 23562 states have (on average 1.4526355996944231) internal successors, (34227), 23707 states have internal predecessors, (34227), 1626 states have call successors, (1626), 817 states have call predecessors, (1626), 953 states have return successors, (3184), 1682 states have call predecessors, (3184), 1625 states have call successors, (3184) [2024-11-07 01:43:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26143 states to 26143 states and 39037 transitions. [2024-11-07 01:43:13,430 INFO L78 Accepts]: Start accepts. Automaton has 26143 states and 39037 transitions. Word has length 101 [2024-11-07 01:43:13,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:43:13,431 INFO L471 AbstractCegarLoop]: Abstraction has 26143 states and 39037 transitions. [2024-11-07 01:43:13,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:43:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 26143 states and 39037 transitions. [2024-11-07 01:43:13,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:43:13,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:43:13,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:43:13,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 01:43:13,441 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:43:13,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:43:13,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1504017067, now seen corresponding path program 1 times [2024-11-07 01:43:13,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:43:13,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901594044] [2024-11-07 01:43:13,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:43:13,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:43:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:13,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:43:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:13,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:43:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:13,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:43:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:13,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:43:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:13,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:43:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:13,568 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-07 01:43:13,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:43:13,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901594044] [2024-11-07 01:43:13,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901594044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:43:13,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:43:13,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:43:13,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782009981] [2024-11-07 01:43:13,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:43:13,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:43:13,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:43:13,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:43:13,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:43:13,572 INFO L87 Difference]: Start difference. First operand 26143 states and 39037 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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-07 01:43:18,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:43:18,844 INFO L93 Difference]: Finished difference Result 88128 states and 131411 transitions. [2024-11-07 01:43:18,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:43:18,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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 101 [2024-11-07 01:43:18,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:43:19,081 INFO L225 Difference]: With dead ends: 88128 [2024-11-07 01:43:19,082 INFO L226 Difference]: Without dead ends: 62921 [2024-11-07 01:43:19,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:43:19,153 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 1256 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:43:19,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1238 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:43:19,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62921 states. [2024-11-07 01:43:23,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62921 to 50437. [2024-11-07 01:43:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50437 states, 45513 states have (on average 1.4525739898490542) internal successors, (66111), 45786 states have internal predecessors, (66111), 3061 states have call successors, (3061), 1597 states have call predecessors, (3061), 1861 states have return successors, (6079), 3117 states have call predecessors, (6079), 3060 states have call successors, (6079) [2024-11-07 01:43:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50437 states to 50437 states and 75251 transitions. [2024-11-07 01:43:23,372 INFO L78 Accepts]: Start accepts. Automaton has 50437 states and 75251 transitions. Word has length 101 [2024-11-07 01:43:23,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:43:23,373 INFO L471 AbstractCegarLoop]: Abstraction has 50437 states and 75251 transitions. [2024-11-07 01:43:23,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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-07 01:43:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 50437 states and 75251 transitions. [2024-11-07 01:43:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:43:23,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:43:23,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:43:23,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 01:43:23,382 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:43:23,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:43:23,382 INFO L85 PathProgramCache]: Analyzing trace with hash -596824148, now seen corresponding path program 1 times [2024-11-07 01:43:23,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:43:23,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028013031] [2024-11-07 01:43:23,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:43:23,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:43:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:23,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:43:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:23,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:43:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:23,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:43:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:23,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:43:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:23,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:43:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:23,520 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-07 01:43:23,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:43:23,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028013031] [2024-11-07 01:43:23,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028013031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:43:23,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:43:23,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:43:23,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626478901] [2024-11-07 01:43:23,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:43:23,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:43:23,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:43:23,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:43:23,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:43:23,523 INFO L87 Difference]: Start difference. First operand 50437 states and 75251 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:43:27,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:43:27,768 INFO L93 Difference]: Finished difference Result 112940 states and 168669 transitions. [2024-11-07 01:43:27,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:43:27,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:43:27,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:43:28,043 INFO L225 Difference]: With dead ends: 112940 [2024-11-07 01:43:28,043 INFO L226 Difference]: Without dead ends: 63439 [2024-11-07 01:43:28,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 01:43:28,138 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 347 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:43:28,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1256 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:43:28,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63439 states. [2024-11-07 01:43:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63439 to 50827. [2024-11-07 01:43:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50827 states, 45903 states have (on average 1.4458967823453805) internal successors, (66371), 46176 states have internal predecessors, (66371), 3061 states have call successors, (3061), 1597 states have call predecessors, (3061), 1861 states have return successors, (6079), 3117 states have call predecessors, (6079), 3060 states have call successors, (6079) [2024-11-07 01:43:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50827 states to 50827 states and 75511 transitions. [2024-11-07 01:43:31,275 INFO L78 Accepts]: Start accepts. Automaton has 50827 states and 75511 transitions. Word has length 101 [2024-11-07 01:43:31,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:43:31,276 INFO L471 AbstractCegarLoop]: Abstraction has 50827 states and 75511 transitions. [2024-11-07 01:43:31,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-07 01:43:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand 50827 states and 75511 transitions. [2024-11-07 01:43:31,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:43:31,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:43:31,282 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:43:31,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 01:43:31,282 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:43:31,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:43:31,283 INFO L85 PathProgramCache]: Analyzing trace with hash -949912530, now seen corresponding path program 1 times [2024-11-07 01:43:31,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:43:31,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528260869] [2024-11-07 01:43:31,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:43:31,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:43:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:31,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:43:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:31,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:43:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:31,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:43:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:31,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:43:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:31,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:43:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:31,417 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-07 01:43:31,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:43:31,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528260869] [2024-11-07 01:43:31,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528260869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:43:31,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:43:31,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:43:31,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300433355] [2024-11-07 01:43:31,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:43:31,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:43:31,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:43:31,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:43:31,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:43:31,420 INFO L87 Difference]: Start difference. First operand 50827 states and 75511 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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)