./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i --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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i', '-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', '65e290fb975399bc2cc283273eaab9fa300db5fe57e6fb279b59522887532a83'] 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i -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 65e290fb975399bc2cc283273eaab9fa300db5fe57e6fb279b59522887532a83 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:42:46,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:42:46,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 06:42:46,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:42:46,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:42:46,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:42:46,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:42:46,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:42:46,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:42:46,265 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:42:46,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:42:46,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:42:46,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:42:46,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:42:46,266 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:42:46,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:42:46,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:42:46,266 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:42:46,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:42:46,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:42:46,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:42:46,266 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:42:46,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:42:46,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:42:46,267 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:42:46,267 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:42:46,267 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:42:46,267 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:42:46,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:42:46,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:42:46,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:42:46,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:42:46,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:42:46,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:42:46,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:42:46,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:42:46,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:42:46,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:42:46,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:42:46,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:42:46,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:42:46,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:42:46,268 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 -> 65e290fb975399bc2cc283273eaab9fa300db5fe57e6fb279b59522887532a83 [2024-11-07 06:42:46,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:42:46,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:42:46,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:42:46,603 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:42:46,603 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:42:46,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i [2024-11-07 06:42:47,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:42:48,113 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:42:48,113 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i [2024-11-07 06:42:48,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c18003781/16dfec018dbe4676a95f12305176e830/FLAGaac36fc17 [2024-11-07 06:42:48,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c18003781/16dfec018dbe4676a95f12305176e830 [2024-11-07 06:42:48,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:42:48,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:42:48,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:42:48,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:42:48,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:42:48,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:42:48" (1/1) ... [2024-11-07 06:42:48,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5af9c01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:48, skipping insertion in model container [2024-11-07 06:42:48,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:42:48" (1/1) ... [2024-11-07 06:42:48,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:42:48,282 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i[919,932] [2024-11-07 06:42:48,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:42:48,344 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:42:48,351 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i[919,932] [2024-11-07 06:42:48,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:42:48,384 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:42:48,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:48 WrapperNode [2024-11-07 06:42:48,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:42:48,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:42:48,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:42:48,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:42:48,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:48" (1/1) ... [2024-11-07 06:42:48,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:48" (1/1) ... [2024-11-07 06:42:48,431 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-11-07 06:42:48,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:42:48,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:42:48,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:42:48,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:42:48,442 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:48" (1/1) ... [2024-11-07 06:42:48,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:48" (1/1) ... [2024-11-07 06:42:48,448 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:48" (1/1) ... [2024-11-07 06:42:48,470 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 06:42:48,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:48" (1/1) ... [2024-11-07 06:42:48,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:48" (1/1) ... [2024-11-07 06:42:48,483 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:48" (1/1) ... [2024-11-07 06:42:48,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:48" (1/1) ... [2024-11-07 06:42:48,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:48" (1/1) ... [2024-11-07 06:42:48,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:48" (1/1) ... [2024-11-07 06:42:48,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:42:48,497 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:42:48,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:42:48,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:42:48,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:48" (1/1) ... [2024-11-07 06:42:48,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:42:48,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:42:48,544 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 06:42:48,547 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 06:42:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:42:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:42:48,578 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:42:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:42:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:42:48,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:42:48,679 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:42:48,685 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:42:49,049 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-07 06:42:49,049 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:42:49,055 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:42:49,056 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:42:49,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:42:49 BoogieIcfgContainer [2024-11-07 06:42:49,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:42:49,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:42:49,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:42:49,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:42:49,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:42:48" (1/3) ... [2024-11-07 06:42:49,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49855db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:42:49, skipping insertion in model container [2024-11-07 06:42:49,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:48" (2/3) ... [2024-11-07 06:42:49,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49855db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:42:49, skipping insertion in model container [2024-11-07 06:42:49,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:42:49" (3/3) ... [2024-11-07 06:42:49,065 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i [2024-11-07 06:42:49,076 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:42:49,076 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:42:49,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:42:49,140 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;@6300e2be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:42:49,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:42:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 62 states have (on average 1.467741935483871) internal successors, (91), 63 states have internal predecessors, (91), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 06:42:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 06:42:49,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:42:49,156 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:49,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:42:49,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:42:49,161 INFO L85 PathProgramCache]: Analyzing trace with hash 790620788, now seen corresponding path program 1 times [2024-11-07 06:42:49,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:42:49,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523161510] [2024-11-07 06:42:49,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:42:49,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:42:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:42:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:42:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:42:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:42:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:42:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:42:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:42:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:42:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:42:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:42:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:42:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:42:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:42:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:42:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:42:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:42:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:42:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:42:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:42:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:42:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:42:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:42:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 06:42:49,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:42:49,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523161510] [2024-11-07 06:42:49,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523161510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:42:49,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:42:49,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:42:49,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445035886] [2024-11-07 06:42:49,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:42:49,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:42:49,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:42:49,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:42:49,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:42:49,556 INFO L87 Difference]: Start difference. First operand has 87 states, 62 states have (on average 1.467741935483871) internal successors, (91), 63 states have internal predecessors, (91), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 06:42:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:42:49,585 INFO L93 Difference]: Finished difference Result 167 states and 286 transitions. [2024-11-07 06:42:49,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:42:49,590 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 152 [2024-11-07 06:42:49,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:42:49,595 INFO L225 Difference]: With dead ends: 167 [2024-11-07 06:42:49,595 INFO L226 Difference]: Without dead ends: 83 [2024-11-07 06:42:49,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:42:49,599 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:42:49,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:42:49,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-07 06:42:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-07 06:42:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 06:42:49,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 128 transitions. [2024-11-07 06:42:49,630 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 128 transitions. Word has length 152 [2024-11-07 06:42:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:42:49,630 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 128 transitions. [2024-11-07 06:42:49,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 06:42:49,631 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 128 transitions. [2024-11-07 06:42:49,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 06:42:49,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:42:49,637 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:49,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:42:49,638 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:42:49,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:42:49,638 INFO L85 PathProgramCache]: Analyzing trace with hash 231458620, now seen corresponding path program 1 times [2024-11-07 06:42:49,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:42:49,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917273026] [2024-11-07 06:42:49,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:42:49,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:42:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:42:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:42:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:42:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:42:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:42:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:42:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:42:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:42:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:42:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:42:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:42:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:42:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:42:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:42:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:42:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:42:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:42:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:42:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:42:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:42:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:42:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:42:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 06:42:50,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:42:50,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917273026] [2024-11-07 06:42:50,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917273026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:42:50,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:42:50,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:42:50,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928060839] [2024-11-07 06:42:50,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:42:50,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:42:50,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:42:50,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:42:50,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:42:50,200 INFO L87 Difference]: Start difference. First operand 83 states and 128 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 06:42:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:42:50,293 INFO L93 Difference]: Finished difference Result 237 states and 372 transitions. [2024-11-07 06:42:50,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:42:50,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2024-11-07 06:42:50,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:42:50,297 INFO L225 Difference]: With dead ends: 237 [2024-11-07 06:42:50,297 INFO L226 Difference]: Without dead ends: 157 [2024-11-07 06:42:50,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:42:50,301 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 71 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:42:50,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 229 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:42:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-07 06:42:50,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 138. [2024-11-07 06:42:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 91 states have internal predecessors, (125), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 06:42:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 213 transitions. [2024-11-07 06:42:50,333 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 213 transitions. Word has length 152 [2024-11-07 06:42:50,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:42:50,334 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 213 transitions. [2024-11-07 06:42:50,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 06:42:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 213 transitions. [2024-11-07 06:42:50,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 06:42:50,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:42:50,337 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:50,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:42:50,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:42:50,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:42:50,337 INFO L85 PathProgramCache]: Analyzing trace with hash -406857361, now seen corresponding path program 1 times [2024-11-07 06:42:50,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:42:50,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630699898] [2024-11-07 06:42:50,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:42:50,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:42:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:42:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:42:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:42:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:42:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:42:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:42:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:42:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:42:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:42:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:42:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:42:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:42:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:42:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:42:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:42:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:42:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:42:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:42:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:42:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:42:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:42:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:42:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 06:42:50,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:42:50,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630699898] [2024-11-07 06:42:50,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630699898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:42:50,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:42:50,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:42:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161286344] [2024-11-07 06:42:50,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:42:50,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:42:50,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:42:50,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:42:50,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:42:50,654 INFO L87 Difference]: Start difference. First operand 138 states and 213 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 06:42:50,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:42:50,703 INFO L93 Difference]: Finished difference Result 306 states and 477 transitions. [2024-11-07 06:42:50,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:42:50,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2024-11-07 06:42:50,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:42:50,706 INFO L225 Difference]: With dead ends: 306 [2024-11-07 06:42:50,706 INFO L226 Difference]: Without dead ends: 218 [2024-11-07 06:42:50,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:42:50,707 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 84 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:42:50,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 235 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:42:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-07 06:42:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2024-11-07 06:42:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 146 states have (on average 1.3904109589041096) internal successors, (203), 146 states have internal predecessors, (203), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 06:42:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 335 transitions. [2024-11-07 06:42:50,755 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 335 transitions. Word has length 153 [2024-11-07 06:42:50,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:42:50,756 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 335 transitions. [2024-11-07 06:42:50,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 06:42:50,756 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 335 transitions. [2024-11-07 06:42:50,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-07 06:42:50,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:42:50,757 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:50,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:42:50,758 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:42:50,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:42:50,758 INFO L85 PathProgramCache]: Analyzing trace with hash 231644096, now seen corresponding path program 1 times [2024-11-07 06:42:50,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:42:50,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317940980] [2024-11-07 06:42:50,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:42:50,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:42:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:42:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:42:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:42:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:42:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:42:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:42:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:42:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:42:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:42:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:42:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:42:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:42:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:42:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:42:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:42:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:42:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:42:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:42:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:42:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:42:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:42:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:42:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,388 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 06:42:51,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:42:51,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317940980] [2024-11-07 06:42:51,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317940980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:42:51,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:42:51,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:42:51,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457755613] [2024-11-07 06:42:51,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:42:51,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:42:51,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:42:51,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:42:51,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:42:51,390 INFO L87 Difference]: Start difference. First operand 216 states and 335 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 06:42:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:42:51,649 INFO L93 Difference]: Finished difference Result 465 states and 708 transitions. [2024-11-07 06:42:51,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:42:51,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2024-11-07 06:42:51,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:42:51,653 INFO L225 Difference]: With dead ends: 465 [2024-11-07 06:42:51,653 INFO L226 Difference]: Without dead ends: 307 [2024-11-07 06:42:51,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:42:51,656 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 134 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:42:51,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 335 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:42:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-07 06:42:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 255. [2024-11-07 06:42:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 182 states have (on average 1.3571428571428572) internal successors, (247), 182 states have internal predecessors, (247), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 06:42:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 379 transitions. [2024-11-07 06:42:51,692 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 379 transitions. Word has length 154 [2024-11-07 06:42:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:42:51,692 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 379 transitions. [2024-11-07 06:42:51,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 06:42:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 379 transitions. [2024-11-07 06:42:51,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 06:42:51,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:42:51,694 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:51,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 06:42:51,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:42:51,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:42:51,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1681486870, now seen corresponding path program 1 times [2024-11-07 06:42:51,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:42:51,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819997443] [2024-11-07 06:42:51,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:42:51,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:42:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:42:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:42:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:42:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:42:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:42:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:42:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:42:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:42:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:42:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:42:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:42:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:42:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:42:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:42:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:42:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:42:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:42:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:42:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:42:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:42:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:42:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:42:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 06:42:51,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:42:51,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819997443] [2024-11-07 06:42:51,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819997443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:42:51,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:42:51,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 06:42:51,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556614851] [2024-11-07 06:42:51,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:42:51,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 06:42:51,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:42:51,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 06:42:51,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:42:51,856 INFO L87 Difference]: Start difference. First operand 255 states and 379 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 06:42:52,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:42:52,149 INFO L93 Difference]: Finished difference Result 584 states and 857 transitions. [2024-11-07 06:42:52,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:42:52,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 155 [2024-11-07 06:42:52,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:42:52,152 INFO L225 Difference]: With dead ends: 584 [2024-11-07 06:42:52,152 INFO L226 Difference]: Without dead ends: 392 [2024-11-07 06:42:52,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:42:52,154 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 309 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:42:52,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 250 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:42:52,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-07 06:42:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 270. [2024-11-07 06:42:52,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 195 states have (on average 1.353846153846154) internal successors, (264), 195 states have internal predecessors, (264), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 06:42:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 396 transitions. [2024-11-07 06:42:52,182 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 396 transitions. Word has length 155 [2024-11-07 06:42:52,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:42:52,182 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 396 transitions. [2024-11-07 06:42:52,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 06:42:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 396 transitions. [2024-11-07 06:42:52,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 06:42:52,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:42:52,184 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:52,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 06:42:52,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:42:52,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:42:52,185 INFO L85 PathProgramCache]: Analyzing trace with hash 660418516, now seen corresponding path program 1 times [2024-11-07 06:42:52,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:42:52,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536232855] [2024-11-07 06:42:52,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:42:52,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:42:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:42:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:42:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:42:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:42:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:42:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:42:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:42:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:42:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:42:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:42:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:42:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:42:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:42:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:42:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:42:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:42:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:42:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:42:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:42:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:42:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:42:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:42:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:52,655 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 06:42:52,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:42:52,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536232855] [2024-11-07 06:42:52,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536232855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:42:52,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:42:52,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:42:52,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020024201] [2024-11-07 06:42:52,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:42:52,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:42:52,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:42:52,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:42:52,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:42:52,657 INFO L87 Difference]: Start difference. First operand 270 states and 396 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 06:42:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:42:52,764 INFO L93 Difference]: Finished difference Result 530 states and 781 transitions. [2024-11-07 06:42:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:42:52,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2024-11-07 06:42:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:42:52,766 INFO L225 Difference]: With dead ends: 530 [2024-11-07 06:42:52,767 INFO L226 Difference]: Without dead ends: 312 [2024-11-07 06:42:52,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:42:52,768 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 111 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:42:52,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 225 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:42:52,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-07 06:42:52,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 270. [2024-11-07 06:42:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 195 states have (on average 1.3487179487179488) internal successors, (263), 195 states have internal predecessors, (263), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 06:42:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 395 transitions. [2024-11-07 06:42:52,794 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 395 transitions. Word has length 155 [2024-11-07 06:42:52,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:42:52,794 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 395 transitions. [2024-11-07 06:42:52,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 06:42:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 395 transitions. [2024-11-07 06:42:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 06:42:52,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:42:52,796 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:52,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 06:42:52,796 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:42:52,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:42:52,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2021574575, now seen corresponding path program 1 times [2024-11-07 06:42:52,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:42:52,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274297426] [2024-11-07 06:42:52,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:42:52,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:42:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:42:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:42:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:42:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:42:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:42:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:42:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:42:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:42:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:42:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:42:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:42:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:42:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:42:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:42:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:42:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:42:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:42:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:42:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:42:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:42:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:42:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:42:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 06:42:53,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:42:53,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274297426] [2024-11-07 06:42:53,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274297426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:42:53,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:42:53,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 06:42:53,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479622108] [2024-11-07 06:42:53,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:42:53,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 06:42:53,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:42:53,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 06:42:53,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:42:53,234 INFO L87 Difference]: Start difference. First operand 270 states and 395 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 06:42:53,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:42:53,526 INFO L93 Difference]: Finished difference Result 575 states and 849 transitions. [2024-11-07 06:42:53,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:42:53,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 157 [2024-11-07 06:42:53,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:42:53,529 INFO L225 Difference]: With dead ends: 575 [2024-11-07 06:42:53,529 INFO L226 Difference]: Without dead ends: 369 [2024-11-07 06:42:53,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:42:53,531 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 225 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:42:53,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 429 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:42:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-07 06:42:53,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 313. [2024-11-07 06:42:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 238 states have (on average 1.365546218487395) internal successors, (325), 238 states have internal predecessors, (325), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 06:42:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 457 transitions. [2024-11-07 06:42:53,560 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 457 transitions. Word has length 157 [2024-11-07 06:42:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:42:53,561 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 457 transitions. [2024-11-07 06:42:53,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 06:42:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 457 transitions. [2024-11-07 06:42:53,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 06:42:53,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:42:53,562 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:53,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 06:42:53,563 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:42:53,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:42:53,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1605517333, now seen corresponding path program 1 times [2024-11-07 06:42:53,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:42:53,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367982916] [2024-11-07 06:42:53,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:42:53,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:42:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:42:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:42:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:42:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:42:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:42:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:42:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:42:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:42:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:42:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:42:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:42:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:42:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:42:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:42:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:42:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:42:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:42:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:42:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:42:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:42:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:42:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:42:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:53,742 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 06:42:53,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:42:53,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367982916] [2024-11-07 06:42:53,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367982916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:42:53,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:42:53,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:42:53,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034826711] [2024-11-07 06:42:53,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:42:53,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:42:53,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:42:53,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:42:53,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:42:53,744 INFO L87 Difference]: Start difference. First operand 313 states and 457 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 06:42:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:42:53,939 INFO L93 Difference]: Finished difference Result 843 states and 1236 transitions. [2024-11-07 06:42:53,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:42:53,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-11-07 06:42:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:42:53,943 INFO L225 Difference]: With dead ends: 843 [2024-11-07 06:42:53,943 INFO L226 Difference]: Without dead ends: 636 [2024-11-07 06:42:53,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:42:53,944 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 197 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:42:53,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 561 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:42:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-07 06:42:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 349. [2024-11-07 06:42:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 274 states have (on average 1.3795620437956204) internal successors, (378), 274 states have internal predecessors, (378), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 06:42:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 510 transitions. [2024-11-07 06:42:53,983 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 510 transitions. Word has length 157 [2024-11-07 06:42:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:42:53,983 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 510 transitions. [2024-11-07 06:42:53,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 06:42:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 510 transitions. [2024-11-07 06:42:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 06:42:53,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:42:53,984 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:53,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 06:42:53,985 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:42:53,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:42:53,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1858026899, now seen corresponding path program 1 times [2024-11-07 06:42:53,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:42:53,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129201476] [2024-11-07 06:42:53,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:42:53,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:42:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:42:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:42:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:42:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:42:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:42:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:42:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:42:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:42:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:42:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:42:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:42:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:42:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:42:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:42:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:42:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:42:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:42:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:42:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:42:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:42:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:42:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:42:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:42:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 06:42:59,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:42:59,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129201476] [2024-11-07 06:42:59,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129201476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:42:59,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:42:59,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 06:42:59,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120905583] [2024-11-07 06:42:59,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:42:59,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 06:42:59,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:42:59,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 06:42:59,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-07 06:42:59,590 INFO L87 Difference]: Start difference. First operand 349 states and 510 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-07 06:43:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:43:00,949 INFO L93 Difference]: Finished difference Result 686 states and 1005 transitions. [2024-11-07 06:43:00,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 06:43:00,949 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 157 [2024-11-07 06:43:00,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:43:00,952 INFO L225 Difference]: With dead ends: 686 [2024-11-07 06:43:00,952 INFO L226 Difference]: Without dead ends: 453 [2024-11-07 06:43:00,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-07 06:43:00,953 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 407 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 06:43:00,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 566 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 06:43:00,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-07 06:43:00,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 353. [2024-11-07 06:43:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 277 states have (on average 1.371841155234657) internal successors, (380), 277 states have internal predecessors, (380), 66 states have call successors, (66), 9 states have call predecessors, (66), 9 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 06:43:00,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 512 transitions. [2024-11-07 06:43:00,977 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 512 transitions. Word has length 157 [2024-11-07 06:43:00,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:43:00,978 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 512 transitions. [2024-11-07 06:43:00,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-07 06:43:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 512 transitions. [2024-11-07 06:43:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 06:43:00,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:43:00,979 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:00,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 06:43:00,979 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:43:00,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:43:00,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1628149587, now seen corresponding path program 1 times [2024-11-07 06:43:00,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:43:00,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160242607] [2024-11-07 06:43:00,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:43:00,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:43:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:43:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:43:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:43:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:43:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:43:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:43:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:43:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:43:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:43:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:43:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:43:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:43:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:43:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:43:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:43:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:43:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:43:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:43:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:43:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:43:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:43:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:43:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 06:43:01,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:43:01,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160242607] [2024-11-07 06:43:01,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160242607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:43:01,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:43:01,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 06:43:01,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546721638] [2024-11-07 06:43:01,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:43:01,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 06:43:01,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:43:01,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 06:43:01,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 06:43:01,210 INFO L87 Difference]: Start difference. First operand 353 states and 512 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 06:43:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:43:01,659 INFO L93 Difference]: Finished difference Result 1206 states and 1768 transitions. [2024-11-07 06:43:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 06:43:01,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 157 [2024-11-07 06:43:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:43:01,664 INFO L225 Difference]: With dead ends: 1206 [2024-11-07 06:43:01,665 INFO L226 Difference]: Without dead ends: 976 [2024-11-07 06:43:01,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2024-11-07 06:43:01,667 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 586 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:43:01,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1317 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:43:01,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-07 06:43:01,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 662. [2024-11-07 06:43:01,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 536 states have (on average 1.4235074626865671) internal successors, (763), 536 states have internal predecessors, (763), 110 states have call successors, (110), 15 states have call predecessors, (110), 15 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-07 06:43:01,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 983 transitions. [2024-11-07 06:43:01,740 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 983 transitions. Word has length 157 [2024-11-07 06:43:01,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:43:01,740 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 983 transitions. [2024-11-07 06:43:01,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 06:43:01,740 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 983 transitions. [2024-11-07 06:43:01,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 06:43:01,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:43:01,742 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:01,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 06:43:01,742 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:43:01,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:43:01,743 INFO L85 PathProgramCache]: Analyzing trace with hash -530742196, now seen corresponding path program 1 times [2024-11-07 06:43:01,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:43:01,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872502374] [2024-11-07 06:43:01,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:43:01,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:43:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:43:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:43:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:43:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:43:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:43:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:43:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:43:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:43:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:43:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:43:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:43:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:43:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:43:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:43:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:43:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:43:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:43:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:43:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:43:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:43:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:43:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:43:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 06:43:01,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:43:01,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872502374] [2024-11-07 06:43:01,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872502374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:43:01,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:43:01,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 06:43:01,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929316755] [2024-11-07 06:43:01,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:43:01,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 06:43:01,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:43:01,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 06:43:01,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:43:01,946 INFO L87 Difference]: Start difference. First operand 662 states and 983 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 06:43:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:43:02,297 INFO L93 Difference]: Finished difference Result 930 states and 1375 transitions. [2024-11-07 06:43:02,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 06:43:02,297 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-11-07 06:43:02,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:43:02,300 INFO L225 Difference]: With dead ends: 930 [2024-11-07 06:43:02,300 INFO L226 Difference]: Without dead ends: 372 [2024-11-07 06:43:02,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-07 06:43:02,301 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 331 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:43:02,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 419 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:43:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-07 06:43:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 314. [2024-11-07 06:43:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 238 states have (on average 1.3319327731092436) internal successors, (317), 238 states have internal predecessors, (317), 66 states have call successors, (66), 9 states have call predecessors, (66), 9 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 06:43:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 449 transitions. [2024-11-07 06:43:02,323 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 449 transitions. Word has length 157 [2024-11-07 06:43:02,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:43:02,323 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 449 transitions. [2024-11-07 06:43:02,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 06:43:02,323 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 449 transitions. [2024-11-07 06:43:02,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 06:43:02,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:43:02,325 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:02,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 06:43:02,325 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:43:02,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:43:02,325 INFO L85 PathProgramCache]: Analyzing trace with hash 462281492, now seen corresponding path program 1 times [2024-11-07 06:43:02,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:43:02,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463809837] [2024-11-07 06:43:02,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:43:02,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:43:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:43:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:43:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:43:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:43:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:43:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:43:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:43:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:43:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:43:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:43:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:43:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:43:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:43:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:43:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:43:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:43:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:43:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:43:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:43:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:43:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:43:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:43:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:43:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 06:43:08,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:43:08,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463809837] [2024-11-07 06:43:08,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463809837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:43:08,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:43:08,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-07 06:43:08,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911458477] [2024-11-07 06:43:08,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:43:08,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 06:43:08,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:43:08,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 06:43:08,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-11-07 06:43:08,980 INFO L87 Difference]: Start difference. First operand 314 states and 449 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-07 06:43:10,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:43:10,879 INFO L93 Difference]: Finished difference Result 594 states and 842 transitions. [2024-11-07 06:43:10,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 06:43:10,879 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 159 [2024-11-07 06:43:10,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:43:10,882 INFO L225 Difference]: With dead ends: 594 [2024-11-07 06:43:10,882 INFO L226 Difference]: Without dead ends: 357 [2024-11-07 06:43:10,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=229, Invalid=641, Unknown=0, NotChecked=0, Total=870 [2024-11-07 06:43:10,884 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 313 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 06:43:10,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 728 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 06:43:10,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-07 06:43:10,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2024-11-07 06:43:10,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 246 states have (on average 1.2926829268292683) internal successors, (318), 246 states have internal predecessors, (318), 66 states have call successors, (66), 9 states have call predecessors, (66), 9 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 06:43:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 450 transitions. [2024-11-07 06:43:10,909 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 450 transitions. Word has length 159 [2024-11-07 06:43:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:43:10,910 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 450 transitions. [2024-11-07 06:43:10,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-07 06:43:10,910 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 450 transitions. [2024-11-07 06:43:10,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 06:43:10,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:43:10,912 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:10,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 06:43:10,912 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:43:10,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:43:10,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2064340593, now seen corresponding path program 1 times [2024-11-07 06:43:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:43:10,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911735149] [2024-11-07 06:43:10,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:43:10,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:43:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat