./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-59.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-10_file-59.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', 'e71601c55174be0ad57296dccc2279fd85b1f2c03bb5913dfcee88384188d311'] 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-10_file-59.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 e71601c55174be0ad57296dccc2279fd85b1f2c03bb5913dfcee88384188d311 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:56:45,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:56:45,958 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:56:45,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:56:45,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:56:45,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:56:45,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:56:45,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:56:45,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:56:45,996 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:56:45,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:56:45,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:56:45,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:56:45,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:56:45,997 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:56:45,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:56:45,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:56:45,997 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:56:45,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:56:45,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:56:45,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:56:45,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:56:45,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:56:45,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:56:45,998 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:56:45,998 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:56:45,999 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:56:45,999 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:56:45,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:56:45,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:56:45,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:56:45,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:56:45,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:56:46,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:56:46,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:56:46,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:56:46,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:56:46,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:56:46,000 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:56:46,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:56:46,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:56:46,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:56:46,001 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 -> e71601c55174be0ad57296dccc2279fd85b1f2c03bb5913dfcee88384188d311 [2024-11-07 04:56:46,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:56:46,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:56:46,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:56:46,313 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:56:46,314 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:56:46,315 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-10_file-59.i [2024-11-07 04:56:47,624 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:56:47,876 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:56:47,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-59.i [2024-11-07 04:56:47,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc010d4a4/6045e007af6847218aa0489ecd00e71f/FLAG5c50c7227 [2024-11-07 04:56:47,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc010d4a4/6045e007af6847218aa0489ecd00e71f [2024-11-07 04:56:47,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:56:47,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:56:47,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:56:47,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:56:47,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:56:47,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:56:47" (1/1) ... [2024-11-07 04:56:47,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21251ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:47, skipping insertion in model container [2024-11-07 04:56:47,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:56:47" (1/1) ... [2024-11-07 04:56:47,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:56:48,073 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-10_file-59.i[915,928] [2024-11-07 04:56:48,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:56:48,144 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:56:48,152 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-10_file-59.i[915,928] [2024-11-07 04:56:48,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:56:48,195 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:56:48,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:48 WrapperNode [2024-11-07 04:56:48,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:56:48,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:56:48,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:56:48,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:56:48,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:48" (1/1) ... [2024-11-07 04:56:48,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:48" (1/1) ... [2024-11-07 04:56:48,255 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-11-07 04:56:48,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:56:48,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:56:48,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:56:48,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:56:48,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:48" (1/1) ... [2024-11-07 04:56:48,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:48" (1/1) ... [2024-11-07 04:56:48,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:48" (1/1) ... [2024-11-07 04:56:48,287 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 04:56:48,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:48" (1/1) ... [2024-11-07 04:56:48,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:48" (1/1) ... [2024-11-07 04:56:48,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:48" (1/1) ... [2024-11-07 04:56:48,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:48" (1/1) ... [2024-11-07 04:56:48,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:48" (1/1) ... [2024-11-07 04:56:48,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:48" (1/1) ... [2024-11-07 04:56:48,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:56:48,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:56:48,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:56:48,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:56:48,317 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:48" (1/1) ... [2024-11-07 04:56:48,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:56:48,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:56:48,348 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 04:56:48,351 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 04:56:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:56:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:56:48,371 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:56:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:56:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:56:48,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:56:48,444 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:56:48,446 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:56:48,866 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-07 04:56:48,866 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:56:48,880 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:56:48,880 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:56:48,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:56:48 BoogieIcfgContainer [2024-11-07 04:56:48,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:56:48,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:56:48,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:56:48,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:56:48,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:56:47" (1/3) ... [2024-11-07 04:56:48,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da815a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:56:48, skipping insertion in model container [2024-11-07 04:56:48,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:56:48" (2/3) ... [2024-11-07 04:56:48,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da815a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:56:48, skipping insertion in model container [2024-11-07 04:56:48,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:56:48" (3/3) ... [2024-11-07 04:56:48,894 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-59.i [2024-11-07 04:56:48,909 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:56:48,910 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:56:48,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:56:48,972 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;@6049adb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:56:48,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:56:48,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 04:56:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-07 04:56:48,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:56:48,992 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:48,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:56:48,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:56:48,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1896989184, now seen corresponding path program 1 times [2024-11-07 04:56:49,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:56:49,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681724282] [2024-11-07 04:56:49,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:49,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:56:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:56:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:56:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 04:56:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:56:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 04:56:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:56:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:56:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:56:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:56:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:56:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:56:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:56:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:56:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:56:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:56:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:56:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 04:56:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:56:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 04:56:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:56:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 04:56:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 04:56:49,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:56:49,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681724282] [2024-11-07 04:56:49,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681724282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:56:49,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:56:49,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:56:49,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640940897] [2024-11-07 04:56:49,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:56:49,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:56:49,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:56:49,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:56:49,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:56:49,472 INFO L87 Difference]: Start difference. First operand has 70 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 04:56:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:56:49,501 INFO L93 Difference]: Finished difference Result 133 states and 225 transitions. [2024-11-07 04:56:49,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:56:49,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2024-11-07 04:56:49,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:56:49,510 INFO L225 Difference]: With dead ends: 133 [2024-11-07 04:56:49,511 INFO L226 Difference]: Without dead ends: 66 [2024-11-07 04:56:49,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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 04:56:49,516 INFO L432 NwaCegarLoop]: 98 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, 98 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 04:56:49,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:56:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-07 04:56:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-07 04:56:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 04:56:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2024-11-07 04:56:49,552 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 139 [2024-11-07 04:56:49,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:56:49,553 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-11-07 04:56:49,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 04:56:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2024-11-07 04:56:49,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-07 04:56:49,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:56:49,555 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:49,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:56:49,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:56:49,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:56:49,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2124689522, now seen corresponding path program 1 times [2024-11-07 04:56:49,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:56:49,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387439117] [2024-11-07 04:56:49,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:49,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:56:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:56:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:56:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 04:56:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:56:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 04:56:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:56:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:56:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:56:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:56:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:56:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:56:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:56:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:56:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:56:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:56:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:56:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 04:56:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:56:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 04:56:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:56:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 04:56:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 04:56:50,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:56:50,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387439117] [2024-11-07 04:56:50,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387439117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:56:50,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:56:50,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:56:50,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696752227] [2024-11-07 04:56:50,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:56:50,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:56:50,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:56:50,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:56:50,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:56:50,225 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:56:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:56:50,422 INFO L93 Difference]: Finished difference Result 193 states and 289 transitions. [2024-11-07 04:56:50,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:56:50,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2024-11-07 04:56:50,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:56:50,426 INFO L225 Difference]: With dead ends: 193 [2024-11-07 04:56:50,427 INFO L226 Difference]: Without dead ends: 130 [2024-11-07 04:56:50,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:56:50,428 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 64 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:56:50,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 278 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 04:56:50,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-07 04:56:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2024-11-07 04:56:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 66 states have internal predecessors, (81), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-07 04:56:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 165 transitions. [2024-11-07 04:56:50,460 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 165 transitions. Word has length 139 [2024-11-07 04:56:50,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:56:50,462 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 165 transitions. [2024-11-07 04:56:50,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:56:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 165 transitions. [2024-11-07 04:56:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 04:56:50,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:56:50,467 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:50,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:56:50,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:56:50,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:56:50,468 INFO L85 PathProgramCache]: Analyzing trace with hash -811586618, now seen corresponding path program 1 times [2024-11-07 04:56:50,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:56:50,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108992315] [2024-11-07 04:56:50,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:50,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:56:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:56:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:56:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 04:56:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:56:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 04:56:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:56:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:56:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:56:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:56:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:56:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:56:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:56:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:56:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:56:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:56:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:56:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 04:56:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:56:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 04:56:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:56:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 04:56:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 04:56:50,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:56:50,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108992315] [2024-11-07 04:56:50,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108992315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:56:50,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:56:50,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:56:50,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300407371] [2024-11-07 04:56:50,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:56:50,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:56:50,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:56:50,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:56:50,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:56:50,956 INFO L87 Difference]: Start difference. First operand 111 states and 165 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:56:51,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:56:51,144 INFO L93 Difference]: Finished difference Result 247 states and 367 transitions. [2024-11-07 04:56:51,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:56:51,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2024-11-07 04:56:51,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:56:51,149 INFO L225 Difference]: With dead ends: 247 [2024-11-07 04:56:51,151 INFO L226 Difference]: Without dead ends: 184 [2024-11-07 04:56:51,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:56:51,153 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 79 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:56:51,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 276 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:56:51,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-07 04:56:51,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 172. [2024-11-07 04:56:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 105 states have (on average 1.2476190476190476) internal successors, (131), 105 states have internal predecessors, (131), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-07 04:56:51,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2024-11-07 04:56:51,195 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 140 [2024-11-07 04:56:51,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:56:51,195 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2024-11-07 04:56:51,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:56:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2024-11-07 04:56:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 04:56:51,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:56:51,199 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:51,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:56:51,200 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:56:51,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:56:51,200 INFO L85 PathProgramCache]: Analyzing trace with hash 229394467, now seen corresponding path program 1 times [2024-11-07 04:56:51,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:56:51,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495668887] [2024-11-07 04:56:51,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:51,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:56:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:56:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:56:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 04:56:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:56:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 04:56:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:56:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:56:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:56:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:56:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:56:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:56:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:56:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:56:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:56:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:56:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:56:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 04:56:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:56:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 04:56:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 04:56:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 04:56:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-07 04:56:51,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:56:51,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495668887] [2024-11-07 04:56:51,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495668887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:56:51,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934336874] [2024-11-07 04:56:51,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:51,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:56:51,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:56:51,787 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 04:56:51,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 04:56:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:51,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 04:56:51,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:56:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 438 proven. 42 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-07 04:56:52,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:56:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-07 04:56:52,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934336874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 04:56:52,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 04:56:52,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-11-07 04:56:52,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288261808] [2024-11-07 04:56:52,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 04:56:52,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 04:56:52,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:56:52,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 04:56:52,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-07 04:56:52,507 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 3 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-07 04:56:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:56:53,450 INFO L93 Difference]: Finished difference Result 560 states and 786 transitions. [2024-11-07 04:56:53,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-07 04:56:53,451 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 3 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 141 [2024-11-07 04:56:53,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:56:53,455 INFO L225 Difference]: With dead ends: 560 [2024-11-07 04:56:53,455 INFO L226 Difference]: Without dead ends: 436 [2024-11-07 04:56:53,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 321 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=399, Invalid=1007, Unknown=0, NotChecked=0, Total=1406 [2024-11-07 04:56:53,458 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 287 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 04:56:53,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 460 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 04:56:53,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-07 04:56:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 336. [2024-11-07 04:56:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 212 states have (on average 1.1650943396226414) internal successors, (247), 214 states have internal predecessors, (247), 105 states have call successors, (105), 18 states have call predecessors, (105), 18 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-07 04:56:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 457 transitions. [2024-11-07 04:56:53,540 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 457 transitions. Word has length 141 [2024-11-07 04:56:53,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:56:53,542 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 457 transitions. [2024-11-07 04:56:53,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 3 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-07 04:56:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 457 transitions. [2024-11-07 04:56:53,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 04:56:53,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:56:53,546 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:53,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 04:56:53,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:56:53,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:56:53,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:56:53,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2004401829, now seen corresponding path program 1 times [2024-11-07 04:56:53,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:56:53,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86093941] [2024-11-07 04:56:53,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:53,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:56:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:56:53,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1028959776] [2024-11-07 04:56:53,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:56:53,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:56:53,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:56:53,856 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 04:56:53,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 04:56:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:56:53,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 04:56:54,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:56:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 210 proven. 144 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-11-07 04:56:55,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:57:02,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:57:02,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86093941] [2024-11-07 04:57:02,559 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 04:57:02,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028959776] [2024-11-07 04:57:02,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028959776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:57:02,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 04:57:02,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-11-07 04:57:02,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040460009] [2024-11-07 04:57:02,562 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 04:57:02,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 04:57:02,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:57:02,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 04:57:02,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2024-11-07 04:57:02,564 INFO L87 Difference]: Start difference. First operand 336 states and 457 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 12 states have internal predecessors, (51), 4 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-07 04:57:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:57:03,164 INFO L93 Difference]: Finished difference Result 666 states and 879 transitions. [2024-11-07 04:57:03,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 04:57:03,165 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 12 states have internal predecessors, (51), 4 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 141 [2024-11-07 04:57:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:57:03,171 INFO L225 Difference]: With dead ends: 666 [2024-11-07 04:57:03,171 INFO L226 Difference]: Without dead ends: 390 [2024-11-07 04:57:03,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2024-11-07 04:57:03,174 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 44 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 04:57:03,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 439 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 04:57:03,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-07 04:57:03,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 372. [2024-11-07 04:57:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 239 states have (on average 1.1380753138075315) internal successors, (272), 241 states have internal predecessors, (272), 105 states have call successors, (105), 27 states have call predecessors, (105), 27 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-07 04:57:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 482 transitions. [2024-11-07 04:57:03,238 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 482 transitions. Word has length 141 [2024-11-07 04:57:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:57:03,239 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 482 transitions. [2024-11-07 04:57:03,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 12 states have internal predecessors, (51), 4 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-07 04:57:03,240 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 482 transitions. [2024-11-07 04:57:03,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 04:57:03,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:57:03,241 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:57:03,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 04:57:03,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:57:03,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:57:03,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:57:03,443 INFO L85 PathProgramCache]: Analyzing trace with hash -28770971, now seen corresponding path program 1 times [2024-11-07 04:57:03,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:57:03,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199167956] [2024-11-07 04:57:03,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:57:03,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:57:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:57:03,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1657729538] [2024-11-07 04:57:03,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:57:03,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:57:03,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:57:03,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 04:57:03,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 04:57:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:57:03,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-07 04:57:03,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:57:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 260 proven. 210 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-07 04:57:05,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:57:27,368 WARN L286 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 04:57:34,060 WARN L286 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 04:57:44,213 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse4 (mod c_~var_1_19~0 4294967296))) (let ((.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse1 (+ .cse4 1)) (.cse6 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse5 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse3 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (or (not (= .cse3 .cse0)) (< .cse4 .cse0)) (forall ((v_z_9 Int)) (or (not (= (mod (* v_z_9 .cse2) 4294967296) v_z_9)) (< v_z_9 .cse1) (< v_z_9 .cse5) (< .cse6 v_z_9))) (or (< .cse6 .cse3) (< .cse3 .cse5) (< .cse4 .cse3)))))) is different from false [2024-11-07 04:57:56,259 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 04:58:04,616 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 04:58:12,633 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 04:58:18,238 WARN L286 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)