./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_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_fillercodesize_ps-cn-50_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', 'e3c6b69598e12a8964c97c957d1e8ad33abec465af98c95276a8354401884a2e'] 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_fillercodesize_ps-cn-50_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 e3c6b69598e12a8964c97c957d1e8ad33abec465af98c95276a8354401884a2e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:35:22,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:35:22,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 05:35:22,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:35:22,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:35:22,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:35:22,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:35:22,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:35:22,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:35:22,165 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:35:22,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:35:22,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:35:22,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:35:22,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:35:22,166 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:35:22,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:35:22,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:35:22,167 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:35:22,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:35:22,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:35:22,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:35:22,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:35:22,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:35:22,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:35:22,168 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:35:22,168 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:35:22,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:35:22,169 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:35:22,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:35:22,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:35:22,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:35:22,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:35:22,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:35:22,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:35:22,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:35:22,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:35:22,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:35:22,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:35:22,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:35:22,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:35:22,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:35:22,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:35:22,171 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 -> e3c6b69598e12a8964c97c957d1e8ad33abec465af98c95276a8354401884a2e [2024-11-07 05:35:22,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:35:22,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:35:22,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:35:22,618 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:35:22,618 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:35:22,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-45.i [2024-11-07 05:35:23,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:35:24,090 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:35:24,090 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-45.i [2024-11-07 05:35:24,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec2d098fc/a1262deebfdf44c989c49c1e3763a716/FLAG9764e7676 [2024-11-07 05:35:24,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec2d098fc/a1262deebfdf44c989c49c1e3763a716 [2024-11-07 05:35:24,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:35:24,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:35:24,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:35:24,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:35:24,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:35:24,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:35:24" (1/1) ... [2024-11-07 05:35:24,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a881ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:35:24, skipping insertion in model container [2024-11-07 05:35:24,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:35:24" (1/1) ... [2024-11-07 05:35:24,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:35:24,283 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_fillercodesize_ps-cn-50_file-45.i[915,928] [2024-11-07 05:35:24,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:35:24,371 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:35:24,385 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_fillercodesize_ps-cn-50_file-45.i[915,928] [2024-11-07 05:35:24,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:35:24,461 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:35:24,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:35:24 WrapperNode [2024-11-07 05:35:24,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:35:24,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:35:24,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:35:24,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:35:24,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:35:24" (1/1) ... [2024-11-07 05:35:24,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:35:24" (1/1) ... [2024-11-07 05:35:24,531 INFO L138 Inliner]: procedures = 26, calls = 54, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2024-11-07 05:35:24,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:35:24,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:35:24,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:35:24,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:35:24,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:35:24" (1/1) ... [2024-11-07 05:35:24,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:35:24" (1/1) ... [2024-11-07 05:35:24,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:35:24" (1/1) ... [2024-11-07 05:35:24,580 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 05:35:24,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:35:24" (1/1) ... [2024-11-07 05:35:24,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:35:24" (1/1) ... [2024-11-07 05:35:24,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:35:24" (1/1) ... [2024-11-07 05:35:24,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:35:24" (1/1) ... [2024-11-07 05:35:24,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:35:24" (1/1) ... [2024-11-07 05:35:24,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:35:24" (1/1) ... [2024-11-07 05:35:24,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:35:24,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:35:24,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:35:24,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:35:24,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:35:24" (1/1) ... [2024-11-07 05:35:24,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:35:24,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:35:24,633 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 05:35:24,638 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 05:35:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:35:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:35:24,661 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:35:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:35:24,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:35:24,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:35:24,745 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:35:24,747 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:35:25,132 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 05:35:25,132 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:35:25,148 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:35:25,149 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:35:25,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:35:25 BoogieIcfgContainer [2024-11-07 05:35:25,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:35:25,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:35:25,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:35:25,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:35:25,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:35:24" (1/3) ... [2024-11-07 05:35:25,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33212049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:35:25, skipping insertion in model container [2024-11-07 05:35:25,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:35:24" (2/3) ... [2024-11-07 05:35:25,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33212049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:35:25, skipping insertion in model container [2024-11-07 05:35:25,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:35:25" (3/3) ... [2024-11-07 05:35:25,158 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-45.i [2024-11-07 05:35:25,171 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:35:25,172 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:35:25,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:35:25,243 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;@7dc7d836, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:35:25,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:35:25,247 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 05:35:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-07 05:35:25,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:35:25,266 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 05:35:25,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:35:25,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:35:25,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1194115112, now seen corresponding path program 1 times [2024-11-07 05:35:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:35:25,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928390595] [2024-11-07 05:35:25,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:35:25,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:35:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:35:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:35:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:35:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:35:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:35:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:35:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:35:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:35:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:35:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:35:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:35:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:35:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:35:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:35:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:35:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:35:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:35:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:35:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:35:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:35:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:35:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:35:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:35:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:35:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:35:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:35:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:35:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 05:35:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 05:35:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 05:35:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 05:35:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 05:35:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 05:35:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 05:35:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-07 05:35:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 05:35:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-07 05:35:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-07 05:35:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-07 05:35:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-07 05:35:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-07 05:35:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:25,830 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 05:35:25,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:35:25,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928390595] [2024-11-07 05:35:25,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928390595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:35:25,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:35:25,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:35:25,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174246800] [2024-11-07 05:35:25,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:35:25,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:35:25,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:35:25,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:35:25,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:35:25,874 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 05:35:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:35:25,916 INFO L93 Difference]: Finished difference Result 207 states and 373 transitions. [2024-11-07 05:35:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:35:25,919 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 05:35:25,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:35:25,925 INFO L225 Difference]: With dead ends: 207 [2024-11-07 05:35:25,926 INFO L226 Difference]: Without dead ends: 103 [2024-11-07 05:35:25,929 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 05:35:25,933 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 05:35:25,934 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 05:35:25,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-07 05:35:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-07 05:35:25,975 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 05:35:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 162 transitions. [2024-11-07 05:35:25,982 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 162 transitions. Word has length 255 [2024-11-07 05:35:25,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:35:25,982 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 162 transitions. [2024-11-07 05:35:25,983 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 05:35:25,983 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 162 transitions. [2024-11-07 05:35:25,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-07 05:35:25,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:35:25,990 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 05:35:25,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:35:25,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:35:25,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:35:25,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1199267662, now seen corresponding path program 1 times [2024-11-07 05:35:25,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:35:25,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993333654] [2024-11-07 05:35:25,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:35:25,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:35:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:35:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:35:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:35:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:35:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:35:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:35:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:35:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:35:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:35:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:35:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:35:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:35:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:35:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:35:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:35:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:35:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:35:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:35:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:35:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:35:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:35:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:35:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:35:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:35:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:35:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:35:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:35:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 05:35:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 05:35:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 05:35:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 05:35:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 05:35:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 05:35:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 05:35:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-07 05:35:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 05:35:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-07 05:35:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-07 05:35:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-07 05:35:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-07 05:35:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-07 05:35:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,456 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 05:35:26,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:35:26,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993333654] [2024-11-07 05:35:26,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993333654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:35:26,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:35:26,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:35:26,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146694283] [2024-11-07 05:35:26,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:35:26,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:35:26,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:35:26,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:35:26,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:35:26,463 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 05:35:26,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:35:26,527 INFO L93 Difference]: Finished difference Result 260 states and 409 transitions. [2024-11-07 05:35:26,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:35:26,528 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 05:35:26,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:35:26,531 INFO L225 Difference]: With dead ends: 260 [2024-11-07 05:35:26,532 INFO L226 Difference]: Without dead ends: 160 [2024-11-07 05:35:26,533 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 05:35:26,534 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 05:35:26,534 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 05:35:26,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-07 05:35:26,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2024-11-07 05:35:26,571 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 05:35:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 247 transitions. [2024-11-07 05:35:26,574 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 247 transitions. Word has length 255 [2024-11-07 05:35:26,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:35:26,575 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 247 transitions. [2024-11-07 05:35:26,575 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 05:35:26,575 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 247 transitions. [2024-11-07 05:35:26,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-07 05:35:26,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:35:26,579 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 05:35:26,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:35:26,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:35:26,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:35:26,580 INFO L85 PathProgramCache]: Analyzing trace with hash -980412944, now seen corresponding path program 1 times [2024-11-07 05:35:26,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:35:26,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768339090] [2024-11-07 05:35:26,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:35:26,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:35:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:35:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:35:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:35:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:35:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:35:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:35:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:35:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:35:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:35:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:35:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:35:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:35:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:35:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:35:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:35:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:35:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:35:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:35:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:35:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:35:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:35:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:35:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:35:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:35:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:35:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:35:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:35:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 05:35:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 05:35:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 05:35:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 05:35:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 05:35:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 05:35:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 05:35:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-07 05:35:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 05:35:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-07 05:35:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-07 05:35:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-07 05:35:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-07 05:35:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-07 05:35:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:26,893 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 05:35:26,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:35:26,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768339090] [2024-11-07 05:35:26,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768339090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:35:26,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:35:26,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:35:26,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176265883] [2024-11-07 05:35:26,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:35:26,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:35:26,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:35:26,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:35:26,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:35:26,898 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 05:35:26,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:35:26,975 INFO L93 Difference]: Finished difference Result 459 states and 723 transitions. [2024-11-07 05:35:26,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:35:26,976 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 05:35:26,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:35:26,985 INFO L225 Difference]: With dead ends: 459 [2024-11-07 05:35:26,985 INFO L226 Difference]: Without dead ends: 305 [2024-11-07 05:35:26,987 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 05:35:26,989 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 05:35:26,991 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 05:35:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-07 05:35:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2024-11-07 05:35:27,063 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 05:35:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 472 transitions. [2024-11-07 05:35:27,069 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 472 transitions. Word has length 255 [2024-11-07 05:35:27,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:35:27,073 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 472 transitions. [2024-11-07 05:35:27,073 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 05:35:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 472 transitions. [2024-11-07 05:35:27,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 05:35:27,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:35:27,080 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 05:35:27,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:35:27,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:35:27,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:35:27,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1014299505, now seen corresponding path program 1 times [2024-11-07 05:35:27,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:35:27,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061548256] [2024-11-07 05:35:27,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:35:27,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:35:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:35:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:35:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:35:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:35:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:35:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:35:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:35:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:35:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:35:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:35:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:35:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:35:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:35:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:35:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:35:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:35:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:35:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:35:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:35:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:35:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:35:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:35:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:35:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:35:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:35:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:35:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:35:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 05:35:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 05:35:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 05:35:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 05:35:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 05:35:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 05:35:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 05:35:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-07 05:35:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 05:35:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-07 05:35:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-07 05:35:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-07 05:35:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-07 05:35:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-07 05:35:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:35:27,622 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 05:35:27,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:35:27,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061548256] [2024-11-07 05:35:27,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061548256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:35:27,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:35:27,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:35:27,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054253406] [2024-11-07 05:35:27,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:35:27,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:35:27,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:35:27,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:35:27,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:35:27,624 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 05:35:27,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:35:27,701 INFO L93 Difference]: Finished difference Result 903 states and 1410 transitions. [2024-11-07 05:35:27,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:35:27,702 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 05:35:27,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:35:27,709 INFO L225 Difference]: With dead ends: 903 [2024-11-07 05:35:27,710 INFO L226 Difference]: Without dead ends: 603 [2024-11-07 05:35:27,712 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 05:35:27,713 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 05:35:27,714 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 05:35:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-07 05:35:27,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 599. [2024-11-07 05:35:27,832 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 05:35:27,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 932 transitions. [2024-11-07 05:35:27,844 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 932 transitions. Word has length 256 [2024-11-07 05:35:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:35:27,847 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 932 transitions. [2024-11-07 05:35:27,847 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 05:35:27,847 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 932 transitions. [2024-11-07 05:35:27,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 05:35:27,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:35:27,855 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 05:35:27,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 05:35:27,855 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:35:27,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:35:27,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1692319889, now seen corresponding path program 1 times [2024-11-07 05:35:27,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:35:27,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347219534] [2024-11-07 05:35:27,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:35:27,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:35:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat