./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-54.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-ci_file-54.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', '9e9b8bba5642fe9ff8c81ef6bed98f69c4969f379b74efc49785b7b71fefc23b'] 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-ci_file-54.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 9e9b8bba5642fe9ff8c81ef6bed98f69c4969f379b74efc49785b7b71fefc23b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:20:53,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:20:53,780 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:20:53,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:20:53,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:20:53,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:20:53,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:20:53,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:20:53,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:20:53,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:20:53,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:20:53,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:20:53,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:20:53,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:20:53,816 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:20:53,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:20:53,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:20:53,817 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:20:53,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:20:53,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:20:53,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:20:53,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:20:53,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:20:53,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:20:53,817 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:20:53,817 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:20:53,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:20:53,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:20:53,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:20:53,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:20:53,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:20:53,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:20:53,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:20:53,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:20:53,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:20:53,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:20:53,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:20:53,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:20:53,818 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:20:53,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:20:53,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:20:53,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:20:53,818 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 -> 9e9b8bba5642fe9ff8c81ef6bed98f69c4969f379b74efc49785b7b71fefc23b [2024-11-07 06:20:54,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:20:54,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:20:54,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:20:54,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:20:54,042 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:20:54,043 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-ci_file-54.i [2024-11-07 06:20:55,240 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:20:55,498 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:20:55,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-54.i [2024-11-07 06:20:55,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bfdd99b0/9f65ff0e34104436beed367dc64630ba/FLAG5a40ec671 [2024-11-07 06:20:55,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bfdd99b0/9f65ff0e34104436beed367dc64630ba [2024-11-07 06:20:55,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:20:55,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:20:55,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:20:55,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:20:55,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:20:55,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:20:55" (1/1) ... [2024-11-07 06:20:55,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d1ed34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:55, skipping insertion in model container [2024-11-07 06:20:55,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:20:55" (1/1) ... [2024-11-07 06:20:55,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:20:55,950 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-ci_file-54.i[919,932] [2024-11-07 06:20:55,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:20:56,006 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:20:56,015 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-ci_file-54.i[919,932] [2024-11-07 06:20:56,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:20:56,056 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:20:56,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:56 WrapperNode [2024-11-07 06:20:56,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:20:56,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:20:56,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:20:56,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:20:56,064 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:20:56" (1/1) ... [2024-11-07 06:20:56,072 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:20:56" (1/1) ... [2024-11-07 06:20:56,102 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-07 06:20:56,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:20:56,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:20:56,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:20:56,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:20:56,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:56" (1/1) ... [2024-11-07 06:20:56,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:56" (1/1) ... [2024-11-07 06:20:56,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:56" (1/1) ... [2024-11-07 06:20:56,131 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:20:56,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:56" (1/1) ... [2024-11-07 06:20:56,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:56" (1/1) ... [2024-11-07 06:20:56,146 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:56" (1/1) ... [2024-11-07 06:20:56,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:56" (1/1) ... [2024-11-07 06:20:56,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:56" (1/1) ... [2024-11-07 06:20:56,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:56" (1/1) ... [2024-11-07 06:20:56,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:20:56,164 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:20:56,167 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:20:56,167 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:20:56,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:56" (1/1) ... [2024-11-07 06:20:56,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:20:56,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:20:56,199 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:20:56,202 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:20:56,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:20:56,221 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:20:56,222 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:20:56,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:20:56,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:20:56,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:20:56,311 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:20:56,313 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:20:56,667 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 06:20:56,667 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:20:56,675 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:20:56,676 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:20:56,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:20:56 BoogieIcfgContainer [2024-11-07 06:20:56,676 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:20:56,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:20:56,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:20:56,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:20:56,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:20:55" (1/3) ... [2024-11-07 06:20:56,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e9176b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:20:56, skipping insertion in model container [2024-11-07 06:20:56,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:56" (2/3) ... [2024-11-07 06:20:56,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e9176b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:20:56, skipping insertion in model container [2024-11-07 06:20:56,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:20:56" (3/3) ... [2024-11-07 06:20:56,685 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-54.i [2024-11-07 06:20:56,697 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:20:56,698 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:20:56,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:20:56,759 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;@7f2608d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:20:56,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:20:56,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 06:20:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 06:20:56,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:20:56,773 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:56,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:20:56,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:20:56,777 INFO L85 PathProgramCache]: Analyzing trace with hash 866825331, now seen corresponding path program 1 times [2024-11-07 06:20:56,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:20:56,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623843001] [2024-11-07 06:20:56,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:20:56,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:20:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:20:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:20:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:20:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:20:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:20:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:20:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:20:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:20:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:20:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:20:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:20:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:20:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:20:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:20:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:20:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:20:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:20:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:20:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:20:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:20:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:20:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:20:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:20:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:20:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:20:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 06:20:57,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:20:57,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623843001] [2024-11-07 06:20:57,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623843001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:20:57,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:20:57,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:20:57,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573144948] [2024-11-07 06:20:57,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:20:57,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:20:57,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:20:57,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:20:57,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:20:57,197 INFO L87 Difference]: Start difference. First operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 06:20:57,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:20:57,223 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2024-11-07 06:20:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:20:57,225 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2024-11-07 06:20:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:20:57,231 INFO L225 Difference]: With dead ends: 162 [2024-11-07 06:20:57,232 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 06:20:57,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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:20:57,239 INFO L432 NwaCegarLoop]: 122 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, 122 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:20:57,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:20:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 06:20:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-07 06:20:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 06:20:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2024-11-07 06:20:57,281 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 167 [2024-11-07 06:20:57,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:20:57,282 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2024-11-07 06:20:57,282 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 06:20:57,282 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-11-07 06:20:57,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 06:20:57,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:20:57,286 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:57,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:20:57,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:20:57,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:20:57,286 INFO L85 PathProgramCache]: Analyzing trace with hash -36584271, now seen corresponding path program 1 times [2024-11-07 06:20:57,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:20:57,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766012498] [2024-11-07 06:20:57,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:20:57,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:20:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:20:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:20:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:20:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:20:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:20:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:20:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:20:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:20:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:20:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:20:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:20:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:20:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:20:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:20:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:20:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:20:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:20:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:20:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:20:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:20:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:20:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:20:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:20:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:20:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:20:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 06:20:57,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:20:57,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766012498] [2024-11-07 06:20:57,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766012498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:20:57,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:20:57,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:20:57,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025166450] [2024-11-07 06:20:57,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:20:57,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:20:57,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:20:57,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:20:57,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:20:57,982 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 06:20:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:20:58,162 INFO L93 Difference]: Finished difference Result 235 states and 361 transitions. [2024-11-07 06:20:58,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:20:58,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-07 06:20:58,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:20:58,164 INFO L225 Difference]: With dead ends: 235 [2024-11-07 06:20:58,164 INFO L226 Difference]: Without dead ends: 158 [2024-11-07 06:20:58,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:20:58,166 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 104 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:20:58,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 349 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:20:58,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-07 06:20:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 127. [2024-11-07 06:20:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 74 states have internal predecessors, (93), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-07 06:20:58,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions. [2024-11-07 06:20:58,196 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 167 [2024-11-07 06:20:58,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:20:58,198 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 193 transitions. [2024-11-07 06:20:58,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 06:20:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2024-11-07 06:20:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 06:20:58,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:20:58,201 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:58,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:20:58,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:20:58,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:20:58,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1997905813, now seen corresponding path program 1 times [2024-11-07 06:20:58,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:20:58,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512980957] [2024-11-07 06:20:58,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:20:58,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:20:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:20:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:20:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:20:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:20:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:20:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:20:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:20:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:20:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:20:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:20:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:20:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:20:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:20:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:20:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:20:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:20:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:20:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:20:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:20:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:20:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:20:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:20:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:20:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:20:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:20:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 06:20:58,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:20:58,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512980957] [2024-11-07 06:20:58,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512980957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:20:58,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:20:58,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:20:58,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411115715] [2024-11-07 06:20:58,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:20:58,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:20:58,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:20:58,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:20:58,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:20:58,600 INFO L87 Difference]: Start difference. First operand 127 states and 193 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 06:20:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:20:58,674 INFO L93 Difference]: Finished difference Result 281 states and 431 transitions. [2024-11-07 06:20:58,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:20:58,675 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2024-11-07 06:20:58,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:20:58,679 INFO L225 Difference]: With dead ends: 281 [2024-11-07 06:20:58,679 INFO L226 Difference]: Without dead ends: 204 [2024-11-07 06:20:58,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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:20:58,683 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 69 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:20:58,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 215 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:20:58,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-07 06:20:58,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2024-11-07 06:20:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 123 states have (on average 1.3008130081300813) internal successors, (160), 123 states have internal predecessors, (160), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-07 06:20:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 310 transitions. [2024-11-07 06:20:58,715 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 310 transitions. Word has length 168 [2024-11-07 06:20:58,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:20:58,715 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 310 transitions. [2024-11-07 06:20:58,716 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 06:20:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 310 transitions. [2024-11-07 06:20:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 06:20:58,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:20:58,721 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:58,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:20:58,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:20:58,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:20:58,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1517258829, now seen corresponding path program 1 times [2024-11-07 06:20:58,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:20:58,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805601394] [2024-11-07 06:20:58,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:20:58,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:20:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:20:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:20:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:20:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:20:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:20:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:20:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:20:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:20:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:20:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:20:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:20:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:20:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:20:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:20:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:20:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:20:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:20:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:20:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:20:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:20:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:20:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:20:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:20:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:20:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:20:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-07 06:20:59,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:20:59,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805601394] [2024-11-07 06:20:59,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805601394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:20:59,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351167276] [2024-11-07 06:20:59,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:20:59,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:20:59,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:20:59,162 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:20:59,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 06:20:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:59,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:20:59,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:20:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 624 proven. 36 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-07 06:20:59,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:20:59,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-07 06:20:59,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351167276] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:20:59,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:20:59,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 06:20:59,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818661757] [2024-11-07 06:20:59,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:20:59,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:20:59,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:20:59,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:20:59,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:20:59,803 INFO L87 Difference]: Start difference. First operand 202 states and 310 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-07 06:21:00,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:21:00,032 INFO L93 Difference]: Finished difference Result 372 states and 561 transitions. [2024-11-07 06:21:00,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 06:21:00,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 169 [2024-11-07 06:21:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:21:00,035 INFO L225 Difference]: With dead ends: 372 [2024-11-07 06:21:00,035 INFO L226 Difference]: Without dead ends: 220 [2024-11-07 06:21:00,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 384 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-07 06:21:00,037 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 130 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:21:00,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 217 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:21:00,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-07 06:21:00,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 214. [2024-11-07 06:21:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 132 states have (on average 1.2651515151515151) internal successors, (167), 132 states have internal predecessors, (167), 75 states have call successors, (75), 6 states have call predecessors, (75), 6 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-07 06:21:00,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 317 transitions. [2024-11-07 06:21:00,070 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 317 transitions. Word has length 169 [2024-11-07 06:21:00,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:21:00,071 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 317 transitions. [2024-11-07 06:21:00,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-07 06:21:00,071 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 317 transitions. [2024-11-07 06:21:00,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 06:21:00,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:21:00,073 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:00,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 06:21:00,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:21:00,274 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:21:00,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:21:00,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1002701105, now seen corresponding path program 1 times [2024-11-07 06:21:00,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:21:00,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496635186] [2024-11-07 06:21:00,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:21:00,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:21:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:21:00,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [898859429] [2024-11-07 06:21:00,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:21:00,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:21:00,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:21:00,395 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:21:00,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 06:21:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:21:00,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 06:21:00,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:21:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 606 proven. 48 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2024-11-07 06:21:01,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:21:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 24 proven. 48 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-07 06:21:49,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:21:49,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496635186] [2024-11-07 06:21:49,734 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 06:21:49,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898859429] [2024-11-07 06:21:49,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898859429] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:21:49,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:21:49,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2024-11-07 06:21:49,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608670394] [2024-11-07 06:21:49,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:21:49,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 06:21:49,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:21:49,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 06:21:49,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2024-11-07 06:21:49,737 INFO L87 Difference]: Start difference. First operand 214 states and 317 transitions. Second operand has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 21 states have internal predecessors, (97), 5 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 5 states have call predecessors, (50), 5 states have call successors, (50) [2024-11-07 06:21:58,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 06:22:00,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 06:22:20,691 WARN L286 SmtUtils]: Spent 7.00s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 06:22:27,384 WARN L286 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 52 DAG size of output: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 06:22:37,024 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 66 DAG size of output: 65 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)