./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-45.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-ps-cn_file-45.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', '9f2334f2a5280c6f8bd58fdc7714429a303d87a42c4cda26bddf4d9076f15b03'] 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-ps-cn_file-45.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 9f2334f2a5280c6f8bd58fdc7714429a303d87a42c4cda26bddf4d9076f15b03 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:04:24,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:04:24,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:04:24,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:04:24,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:04:24,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:04:24,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:04:24,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:04:24,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:04:24,838 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:04:24,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:04:24,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:04:24,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:04:24,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:04:24,839 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:04:24,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:04:24,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:04:24,839 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:04:24,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:04:24,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:04:24,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:04:24,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:04:24,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:04:24,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:04:24,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:04:24,840 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:04:24,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:04:24,840 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:04:24,840 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:04:24,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:04:24,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:04:24,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:04:24,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:04:24,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:04:24,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:04:24,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:04:24,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:04:24,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:04:24,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:04:24,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:04:24,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:04:24,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:04:24,841 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 -> 9f2334f2a5280c6f8bd58fdc7714429a303d87a42c4cda26bddf4d9076f15b03 [2024-11-07 07:04:25,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:04:25,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:04:25,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:04:25,067 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:04:25,067 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:04:25,069 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-ps-cn_file-45.i [2024-11-07 07:04:26,320 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:04:26,569 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:04:26,570 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-45.i [2024-11-07 07:04:26,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb301274b/18e35d69fb1144de8c3288c9fddb631f/FLAGb2958b37a [2024-11-07 07:04:26,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb301274b/18e35d69fb1144de8c3288c9fddb631f [2024-11-07 07:04:26,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:04:26,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:04:26,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:04:26,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:04:26,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:04:26,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:04:26" (1/1) ... [2024-11-07 07:04:26,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d1db158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26, skipping insertion in model container [2024-11-07 07:04:26,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:04:26" (1/1) ... [2024-11-07 07:04:26,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:04:26,730 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-ps-cn_file-45.i[919,932] [2024-11-07 07:04:26,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:04:26,836 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:04:26,845 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-ps-cn_file-45.i[919,932] [2024-11-07 07:04:26,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:04:26,895 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:04:26,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26 WrapperNode [2024-11-07 07:04:26,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:04:26,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:04:26,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:04:26,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:04:26,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2024-11-07 07:04:26,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2024-11-07 07:04:26,947 INFO L138 Inliner]: procedures = 26, calls = 54, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2024-11-07 07:04:26,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:04:26,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:04:26,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:04:26,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:04:26,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2024-11-07 07:04:26,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2024-11-07 07:04:26,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2024-11-07 07:04:26,976 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 07:04:26,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2024-11-07 07:04:26,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2024-11-07 07:04:26,990 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2024-11-07 07:04:26,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2024-11-07 07:04:26,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2024-11-07 07:04:26,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2024-11-07 07:04:27,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:04:27,001 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:04:27,001 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:04:27,001 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:04:27,002 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (1/1) ... [2024-11-07 07:04:27,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:04:27,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:04:27,040 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 07:04:27,048 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 07:04:27,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:04:27,067 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:04:27,068 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:04:27,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:04:27,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:04:27,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:04:27,169 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:04:27,171 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:04:27,498 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 07:04:27,498 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:04:27,511 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:04:27,511 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:04:27,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:04:27 BoogieIcfgContainer [2024-11-07 07:04:27,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:04:27,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:04:27,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:04:27,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:04:27,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:04:26" (1/3) ... [2024-11-07 07:04:27,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39703bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:04:27, skipping insertion in model container [2024-11-07 07:04:27,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:04:26" (2/3) ... [2024-11-07 07:04:27,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39703bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:04:27, skipping insertion in model container [2024-11-07 07:04:27,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:04:27" (3/3) ... [2024-11-07 07:04:27,522 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-45.i [2024-11-07 07:04:27,534 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:04:27,534 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:04:27,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:04:27,611 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;@78e81fd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:04:27,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:04:27,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 63 states have (on average 1.380952380952381) internal successors, (87), 64 states have internal predecessors, (87), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-07 07:04:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-07 07:04:27,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:04:27,635 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:04:27,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:04:27,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:04:27,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1194115112, now seen corresponding path program 1 times [2024-11-07 07:04:27,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:04:27,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112355736] [2024-11-07 07:04:27,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:04:27,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:04:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:27,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:04:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:27,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:04:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:27,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:04:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:27,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:04:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:27,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:04:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:27,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:04:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:27,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:04:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:27,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:04:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:27,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:04:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:27,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:04:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:27,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:04:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:27,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:04:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:04:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:04:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:04:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:04:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:04:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:04:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:04:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:04:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 07:04:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:04:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:04:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:04:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 07:04:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 07:04:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 07:04:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 07:04:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 07:04:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 07:04:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 07:04:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 07:04:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 07:04:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 07:04:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-07 07:04:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 07:04:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-07 07:04:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-07 07:04:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-07 07:04:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-07 07:04:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-07 07:04:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-11-07 07:04:28,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:04:28,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112355736] [2024-11-07 07:04:28,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112355736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:04:28,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:04:28,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:04:28,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114965488] [2024-11-07 07:04:28,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:04:28,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:04:28,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:04:28,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:04:28,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:04:28,157 INFO L87 Difference]: Start difference. First operand has 107 states, 63 states have (on average 1.380952380952381) internal successors, (87), 64 states have internal predecessors, (87), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-07 07:04:28,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:04:28,185 INFO L93 Difference]: Finished difference Result 207 states and 373 transitions. [2024-11-07 07:04:28,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:04:28,187 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) Word has length 255 [2024-11-07 07:04:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:04:28,194 INFO L225 Difference]: With dead ends: 207 [2024-11-07 07:04:28,194 INFO L226 Difference]: Without dead ends: 103 [2024-11-07 07:04:28,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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 07:04:28,199 INFO L432 NwaCegarLoop]: 162 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, 162 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 07:04:28,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:04:28,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-07 07:04:28,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-07 07:04:28,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 60 states have internal predecessors, (80), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-07 07:04:28,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 162 transitions. [2024-11-07 07:04:28,264 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 162 transitions. Word has length 255 [2024-11-07 07:04:28,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:04:28,265 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 162 transitions. [2024-11-07 07:04:28,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-07 07:04:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 162 transitions. [2024-11-07 07:04:28,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-07 07:04:28,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:04:28,271 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:04:28,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:04:28,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:04:28,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:04:28,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1199267662, now seen corresponding path program 1 times [2024-11-07 07:04:28,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:04:28,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765471670] [2024-11-07 07:04:28,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:04:28,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:04:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:04:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:04:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:04:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:04:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:04:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:04:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:04:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:04:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:04:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:04:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:04:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:04:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:04:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:04:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:04:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:04:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:04:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:04:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:04:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:04:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 07:04:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:04:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:04:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:04:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 07:04:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 07:04:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 07:04:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 07:04:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 07:04:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 07:04:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 07:04:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 07:04:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 07:04:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 07:04:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-07 07:04:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 07:04:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-07 07:04:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-07 07:04:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-07 07:04:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-07 07:04:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-07 07:04:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-11-07 07:04:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:04:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765471670] [2024-11-07 07:04:28,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765471670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:04:28,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:04:28,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:04:28,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869265491] [2024-11-07 07:04:28,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:04:28,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:04:28,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:04:28,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:04:28,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:04:28,677 INFO L87 Difference]: Start difference. First operand 103 states and 162 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-07 07:04:28,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:04:28,720 INFO L93 Difference]: Finished difference Result 260 states and 409 transitions. [2024-11-07 07:04:28,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:04:28,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 255 [2024-11-07 07:04:28,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:04:28,723 INFO L225 Difference]: With dead ends: 260 [2024-11-07 07:04:28,723 INFO L226 Difference]: Without dead ends: 160 [2024-11-07 07:04:28,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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 07:04:28,724 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 91 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:04:28,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 347 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:04:28,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-07 07:04:28,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2024-11-07 07:04:28,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 98 states have internal predecessors, (133), 57 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-07 07:04:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 247 transitions. [2024-11-07 07:04:28,756 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 247 transitions. Word has length 255 [2024-11-07 07:04:28,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:04:28,757 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 247 transitions. [2024-11-07 07:04:28,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-07 07:04:28,761 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 247 transitions. [2024-11-07 07:04:28,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-07 07:04:28,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:04:28,767 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:04:28,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:04:28,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:04:28,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:04:28,768 INFO L85 PathProgramCache]: Analyzing trace with hash -980412944, now seen corresponding path program 1 times [2024-11-07 07:04:28,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:04:28,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467734118] [2024-11-07 07:04:28,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:04:28,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:04:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:04:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:04:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:04:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:04:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:04:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:04:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:04:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:04:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:04:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:04:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:04:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:04:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:04:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:04:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:04:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:04:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:04:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:04:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:28,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:04:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:04:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 07:04:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:04:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:04:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:04:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 07:04:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 07:04:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 07:04:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 07:04:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 07:04:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 07:04:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 07:04:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 07:04:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 07:04:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 07:04:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-07 07:04:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 07:04:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-07 07:04:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-07 07:04:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-07 07:04:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-07 07:04:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-07 07:04:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-11-07 07:04:29,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:04:29,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467734118] [2024-11-07 07:04:29,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467734118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:04:29,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:04:29,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:04:29,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377677014] [2024-11-07 07:04:29,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:04:29,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:04:29,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:04:29,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:04:29,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:04:29,059 INFO L87 Difference]: Start difference. First operand 157 states and 247 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-07 07:04:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:04:29,131 INFO L93 Difference]: Finished difference Result 459 states and 723 transitions. [2024-11-07 07:04:29,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:04:29,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 255 [2024-11-07 07:04:29,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:04:29,137 INFO L225 Difference]: With dead ends: 459 [2024-11-07 07:04:29,137 INFO L226 Difference]: Without dead ends: 305 [2024-11-07 07:04:29,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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 07:04:29,138 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 151 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:04:29,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 317 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:04:29,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-07 07:04:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2024-11-07 07:04:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 184 states have (on average 1.326086956521739) internal successors, (244), 186 states have internal predecessors, (244), 114 states have call successors, (114), 4 states have call predecessors, (114), 4 states have return successors, (114), 112 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-07 07:04:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 472 transitions. [2024-11-07 07:04:29,201 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 472 transitions. Word has length 255 [2024-11-07 07:04:29,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:04:29,203 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 472 transitions. [2024-11-07 07:04:29,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-07 07:04:29,205 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 472 transitions. [2024-11-07 07:04:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 07:04:29,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:04:29,207 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:04:29,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:04:29,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:04:29,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:04:29,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1014299505, now seen corresponding path program 1 times [2024-11-07 07:04:29,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:04:29,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302951646] [2024-11-07 07:04:29,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:04:29,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:04:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:04:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:04:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:04:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:04:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:04:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:04:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:04:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:04:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:04:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:04:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:04:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:04:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:04:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:04:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:04:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:04:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:04:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:04:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:04:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:04:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 07:04:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:04:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:04:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:04:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 07:04:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 07:04:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 07:04:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 07:04:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 07:04:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 07:04:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 07:04:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 07:04:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 07:04:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 07:04:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-07 07:04:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 07:04:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-07 07:04:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-07 07:04:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-07 07:04:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-07 07:04:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-07 07:04:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-11-07 07:04:29,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:04:29,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302951646] [2024-11-07 07:04:29,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302951646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:04:29,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:04:29,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:04:29,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510796314] [2024-11-07 07:04:29,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:04:29,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:04:29,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:04:29,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:04:29,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:04:29,674 INFO L87 Difference]: Start difference. First operand 303 states and 472 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-07 07:04:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:04:29,741 INFO L93 Difference]: Finished difference Result 903 states and 1410 transitions. [2024-11-07 07:04:29,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:04:29,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 256 [2024-11-07 07:04:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:04:29,749 INFO L225 Difference]: With dead ends: 903 [2024-11-07 07:04:29,750 INFO L226 Difference]: Without dead ends: 603 [2024-11-07 07:04:29,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 83 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 07:04:29,753 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 83 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:04:29,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 314 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:04:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-07 07:04:29,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 599. [2024-11-07 07:04:29,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 362 states have (on average 1.3149171270718232) internal successors, (476), 366 states have internal predecessors, (476), 228 states have call successors, (228), 8 states have call predecessors, (228), 8 states have return successors, (228), 224 states have call predecessors, (228), 228 states have call successors, (228) [2024-11-07 07:04:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 932 transitions. [2024-11-07 07:04:29,834 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 932 transitions. Word has length 256 [2024-11-07 07:04:29,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:04:29,835 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 932 transitions. [2024-11-07 07:04:29,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-07 07:04:29,836 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 932 transitions. [2024-11-07 07:04:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 07:04:29,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:04:29,840 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:04:29,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:04:29,841 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:04:29,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:04:29,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1692319889, now seen corresponding path program 1 times [2024-11-07 07:04:29,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:04:29,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170417551] [2024-11-07 07:04:29,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:04:29,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:04:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat