./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.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_floatingpointinfluence_no-floats_file-79.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', '434b16a64b06ae36ef836c68b9042912d6cf793be5a1688bb3a25d59d1194c23'] 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_floatingpointinfluence_no-floats_file-79.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 434b16a64b06ae36ef836c68b9042912d6cf793be5a1688bb3a25d59d1194c23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:51:49,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:51:49,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:51:49,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:51:49,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:51:49,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:51:49,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:51:49,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:51:49,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:51:49,830 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:51:49,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:51:49,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:51:49,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:51:49,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:51:49,832 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:51:49,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:51:49,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:51:49,833 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:51:49,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:51:49,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:51:49,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:51:49,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:51:49,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:51:49,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:51:49,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:51:49,833 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:51:49,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:51:49,833 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:51:49,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:51:49,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:51:49,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:51:49,834 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:51:49,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:51:49,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:51:49,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:51:49,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:51:49,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:51:49,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:51:49,834 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:51:49,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:51:49,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:51:49,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:51:49,834 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 -> 434b16a64b06ae36ef836c68b9042912d6cf793be5a1688bb3a25d59d1194c23 [2024-11-07 07:51:50,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:51:50,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:51:50,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:51:50,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:51:50,155 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:51:50,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-07 07:51:51,440 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:51:51,668 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:51:51,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-07 07:51:51,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/079e19e2e/6759ab1b2e6e4cd3b56194f3f1f6bde0/FLAG2fec3b11f [2024-11-07 07:51:51,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/079e19e2e/6759ab1b2e6e4cd3b56194f3f1f6bde0 [2024-11-07 07:51:51,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:51:51,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:51:51,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:51:51,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:51:51,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:51:51,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:51:51" (1/1) ... [2024-11-07 07:51:51,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa0f697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:51, skipping insertion in model container [2024-11-07 07:51:51,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:51:51" (1/1) ... [2024-11-07 07:51:51,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:51:51,836 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_floatingpointinfluence_no-floats_file-79.i[916,929] [2024-11-07 07:51:51,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:51:51,875 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:51:51,883 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_floatingpointinfluence_no-floats_file-79.i[916,929] [2024-11-07 07:51:51,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:51:51,912 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:51:51,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:51 WrapperNode [2024-11-07 07:51:51,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:51:51,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:51:51,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:51:51,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:51:51,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:51" (1/1) ... [2024-11-07 07:51:51,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:51" (1/1) ... [2024-11-07 07:51:51,964 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-11-07 07:51:51,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:51:51,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:51:51,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:51:51,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:51:51,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:51" (1/1) ... [2024-11-07 07:51:51,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:51" (1/1) ... [2024-11-07 07:51:51,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:51" (1/1) ... [2024-11-07 07:51:52,011 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:51:52,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:51" (1/1) ... [2024-11-07 07:51:52,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:51" (1/1) ... [2024-11-07 07:51:52,016 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:51" (1/1) ... [2024-11-07 07:51:52,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:51" (1/1) ... [2024-11-07 07:51:52,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:51" (1/1) ... [2024-11-07 07:51:52,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:51" (1/1) ... [2024-11-07 07:51:52,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:51:52,032 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:51:52,032 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:51:52,032 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:51:52,033 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:51" (1/1) ... [2024-11-07 07:51:52,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:51:52,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:51:52,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:51:52,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:51:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:51:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:51:52,106 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:51:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:51:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:51:52,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:51:52,184 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:51:52,186 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:51:52,495 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 07:51:52,495 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:51:52,509 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:51:52,509 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:51:52,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:51:52 BoogieIcfgContainer [2024-11-07 07:51:52,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:51:52,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:51:52,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:51:52,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:51:52,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:51:51" (1/3) ... [2024-11-07 07:51:52,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312696c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:51:52, skipping insertion in model container [2024-11-07 07:51:52,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:51" (2/3) ... [2024-11-07 07:51:52,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312696c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:51:52, skipping insertion in model container [2024-11-07 07:51:52,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:51:52" (3/3) ... [2024-11-07 07:51:52,521 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-07 07:51:52,534 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:51:52,535 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:51:52,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:51:52,606 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;@19d61603, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:51:52,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:51:52,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 07:51:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 07:51:52,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:51:52,623 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:51:52,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:51:52,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:51:52,629 INFO L85 PathProgramCache]: Analyzing trace with hash 911261099, now seen corresponding path program 1 times [2024-11-07 07:51:52,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:51:52,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897003915] [2024-11-07 07:51:52,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:51:52,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:51:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:52,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:51:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:52,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:51:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:52,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:51:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:52,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:51:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:52,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:51:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:52,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:51:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:52,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:51:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:52,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:51:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:52,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:51:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:52,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:51:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:52,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:51:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:52,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:51:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:52,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:51:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:52,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:51:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:51:53,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:51:53,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897003915] [2024-11-07 07:51:53,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897003915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:51:53,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:51:53,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:51:53,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875042400] [2024-11-07 07:51:53,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:51:53,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:51:53,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:51:53,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:51:53,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:51:53,039 INFO L87 Difference]: Start difference. First operand has 55 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 07:51:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:51:53,060 INFO L93 Difference]: Finished difference Result 103 states and 168 transitions. [2024-11-07 07:51:53,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:51:53,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2024-11-07 07:51:53,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:51:53,069 INFO L225 Difference]: With dead ends: 103 [2024-11-07 07:51:53,069 INFO L226 Difference]: Without dead ends: 51 [2024-11-07 07:51:53,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:51:53,079 INFO L432 NwaCegarLoop]: 73 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, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:51:53,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:51:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-07 07:51:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-07 07:51:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 07:51:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-07 07:51:53,114 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 94 [2024-11-07 07:51:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:51:53,114 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-07 07:51:53,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 07:51:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-07 07:51:53,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 07:51:53,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:51:53,118 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:51:53,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:51:53,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:51:53,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:51:53,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2103931797, now seen corresponding path program 1 times [2024-11-07 07:51:53,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:51:53,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519723334] [2024-11-07 07:51:53,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:51:53,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:51:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:53,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:51:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:53,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:51:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:53,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:51:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:53,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:51:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:53,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:51:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:53,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:51:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:53,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:51:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:53,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:51:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:53,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:51:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:53,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:51:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:53,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:51:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:53,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:51:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:53,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:51:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:53,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:51:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:51:53,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:51:53,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519723334] [2024-11-07 07:51:53,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519723334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:51:53,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:51:53,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:51:53,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139867102] [2024-11-07 07:51:53,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:51:53,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:51:53,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:51:53,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:51:53,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:51:53,727 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:51:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:51:53,829 INFO L93 Difference]: Finished difference Result 145 states and 209 transitions. [2024-11-07 07:51:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:51:53,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-07 07:51:53,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:51:53,832 INFO L225 Difference]: With dead ends: 145 [2024-11-07 07:51:53,832 INFO L226 Difference]: Without dead ends: 97 [2024-11-07 07:51:53,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:51:53,835 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:51:53,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 565 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:51:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-07 07:51:53,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 53. [2024-11-07 07:51:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 07:51:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-07 07:51:53,857 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 94 [2024-11-07 07:51:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:51:53,859 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-07 07:51:53,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:51:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-07 07:51:53,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 07:51:53,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:51:53,864 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:51:53,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:51:53,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:51:53,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:51:53,866 INFO L85 PathProgramCache]: Analyzing trace with hash 148363339, now seen corresponding path program 1 times [2024-11-07 07:51:53,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:51:53,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511900627] [2024-11-07 07:51:53,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:51:53,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:51:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:54,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:51:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:54,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:51:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:54,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:51:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:54,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:51:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:54,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:51:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:54,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:51:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:54,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:51:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:51:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:54,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:51:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:54,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:51:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:54,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:51:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:54,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:51:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:54,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:51:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:54,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:51:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:51:54,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:51:54,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511900627] [2024-11-07 07:51:54,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511900627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:51:54,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:51:54,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:51:54,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801959158] [2024-11-07 07:51:54,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:51:54,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:51:54,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:51:54,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:51:54,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:51:54,307 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:51:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:51:54,544 INFO L93 Difference]: Finished difference Result 149 states and 212 transitions. [2024-11-07 07:51:54,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:51:54,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-11-07 07:51:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:51:54,546 INFO L225 Difference]: With dead ends: 149 [2024-11-07 07:51:54,546 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 07:51:54,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:51:54,548 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 67 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:51:54,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 315 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:51:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 07:51:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 51. [2024-11-07 07:51:54,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 07:51:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2024-11-07 07:51:54,562 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 95 [2024-11-07 07:51:54,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:51:54,562 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2024-11-07 07:51:54,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:51:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2024-11-07 07:51:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 07:51:54,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:51:54,564 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:51:54,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:51:54,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:51:54,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:51:54,565 INFO L85 PathProgramCache]: Analyzing trace with hash 502683334, now seen corresponding path program 1 times [2024-11-07 07:51:54,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:51:54,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293420393] [2024-11-07 07:51:54,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:51:54,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:51:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:55,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:51:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:55,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:51:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:55,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:51:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:55,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:51:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:55,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:51:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:55,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:51:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:55,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:51:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:55,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:51:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:55,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:51:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:55,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:51:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:55,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:51:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:55,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:51:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:55,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:51:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:55,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:51:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 07:51:55,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:51:55,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293420393] [2024-11-07 07:51:55,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293420393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:51:55,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:51:55,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:51:55,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873879435] [2024-11-07 07:51:55,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:51:55,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:51:55,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:51:55,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:51:55,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:51:55,168 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:51:55,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:51:55,319 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2024-11-07 07:51:55,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:51:55,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2024-11-07 07:51:55,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:51:55,321 INFO L225 Difference]: With dead ends: 105 [2024-11-07 07:51:55,321 INFO L226 Difference]: Without dead ends: 57 [2024-11-07 07:51:55,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:51:55,323 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 73 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:51:55,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 134 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:51:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-07 07:51:55,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-11-07 07:51:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 07:51:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2024-11-07 07:51:55,334 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 96 [2024-11-07 07:51:55,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:51:55,335 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2024-11-07 07:51:55,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:51:55,335 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2024-11-07 07:51:55,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 07:51:55,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:51:55,340 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:51:55,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:51:55,341 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:51:55,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:51:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash 294791846, now seen corresponding path program 1 times [2024-11-07 07:51:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:51:55,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496562983] [2024-11-07 07:51:55,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:51:55,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:51:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:51:55,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580099528] [2024-11-07 07:51:55,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:51:55,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:51:55,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:51:55,397 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 07:51:55,399 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 07:51:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:55,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 07:51:55,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:51:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 07:51:56,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:51:56,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:51:56,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496562983] [2024-11-07 07:51:56,690 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 07:51:56,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580099528] [2024-11-07 07:51:56,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580099528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:51:56,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:51:56,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 07:51:56,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460837497] [2024-11-07 07:51:56,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:51:56,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 07:51:56,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:51:56,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 07:51:56,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-07 07:51:56,694 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:51:57,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:51:57,365 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2024-11-07 07:51:57,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 07:51:57,366 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-11-07 07:51:57,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:51:57,368 INFO L225 Difference]: With dead ends: 97 [2024-11-07 07:51:57,369 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 07:51:57,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-11-07 07:51:57,371 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 114 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 07:51:57,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 230 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 07:51:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 07:51:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 68. [2024-11-07 07:51:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 07:51:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2024-11-07 07:51:57,381 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 97 [2024-11-07 07:51:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:51:57,382 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 89 transitions. [2024-11-07 07:51:57,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:51:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2024-11-07 07:51:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 07:51:57,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:51:57,383 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:51:57,403 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 07:51:57,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:51:57,588 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:51:57,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:51:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2032362108, now seen corresponding path program 1 times [2024-11-07 07:51:57,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:51:57,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772013025] [2024-11-07 07:51:57,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:51:57,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:51:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:57,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:51:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:57,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:51:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:57,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:51:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:57,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:51:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:57,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:51:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:57,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:51:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:57,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:51:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:57,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:51:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:57,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:51:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:57,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:51:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:57,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:51:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:57,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:51:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:57,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:51:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:57,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:51:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:51:57,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:51:57,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772013025] [2024-11-07 07:51:57,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772013025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:51:57,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:51:57,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:51:57,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368949265] [2024-11-07 07:51:57,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:51:57,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:51:57,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:51:57,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:51:57,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:51:57,725 INFO L87 Difference]: Start difference. First operand 68 states and 89 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:51:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:51:57,762 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2024-11-07 07:51:57,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:51:57,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-07 07:51:57,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:51:57,764 INFO L225 Difference]: With dead ends: 151 [2024-11-07 07:51:57,764 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 07:51:57,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:51:57,765 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 16 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:51:57,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 119 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:51:57,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 07:51:57,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2024-11-07 07:51:57,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 07:51:57,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2024-11-07 07:51:57,780 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 98 [2024-11-07 07:51:57,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:51:57,780 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2024-11-07 07:51:57,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:51:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2024-11-07 07:51:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 07:51:57,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:51:57,782 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:51:57,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 07:51:57,782 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:51:57,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:51:57,783 INFO L85 PathProgramCache]: Analyzing trace with hash -39747269, now seen corresponding path program 1 times [2024-11-07 07:51:57,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:51:57,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939296028] [2024-11-07 07:51:57,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:51:57,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:51:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:51:57,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [981943207] [2024-11-07 07:51:57,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:51:57,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:51:57,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:51:57,833 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 07:51:57,835 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 07:51:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:57,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-07 07:51:57,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:51:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 07:51:59,013 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:51:59,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:51:59,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939296028] [2024-11-07 07:51:59,014 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 07:51:59,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981943207] [2024-11-07 07:51:59,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981943207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:51:59,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:51:59,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 07:51:59,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169428548] [2024-11-07 07:51:59,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:51:59,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 07:51:59,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:51:59,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 07:51:59,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-07 07:51:59,016 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 07:51:59,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:51:59,606 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2024-11-07 07:51:59,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 07:51:59,607 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 98 [2024-11-07 07:51:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:51:59,608 INFO L225 Difference]: With dead ends: 99 [2024-11-07 07:51:59,608 INFO L226 Difference]: Without dead ends: 97 [2024-11-07 07:51:59,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2024-11-07 07:51:59,609 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 83 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:51:59,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 252 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 07:51:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-07 07:51:59,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2024-11-07 07:51:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 07:51:59,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2024-11-07 07:51:59,624 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 98 [2024-11-07 07:51:59,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:51:59,625 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2024-11-07 07:51:59,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 07:51:59,626 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2024-11-07 07:51:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 07:51:59,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:51:59,629 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:51:59,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 07:51:59,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:51:59,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:51:59,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:51:59,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1296140404, now seen corresponding path program 1 times [2024-11-07 07:51:59,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:51:59,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747979950] [2024-11-07 07:51:59,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:51:59,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:51:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:51:59,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1212582326] [2024-11-07 07:51:59,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:51:59,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:51:59,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:51:59,883 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 07:51:59,885 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 07:51:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:51:59,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 07:51:59,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:52:01,357 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 07:52:01,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:52:01,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:52:01,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747979950] [2024-11-07 07:52:01,358 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 07:52:01,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212582326] [2024-11-07 07:52:01,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212582326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:52:01,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:52:01,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 07:52:01,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264945866] [2024-11-07 07:52:01,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:52:01,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 07:52:01,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:52:01,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 07:52:01,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-07 07:52:01,360 INFO L87 Difference]: Start difference. First operand 79 states and 103 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:52:02,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:52:02,881 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2024-11-07 07:52:02,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 07:52:02,882 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-07 07:52:02,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:52:02,884 INFO L225 Difference]: With dead ends: 120 [2024-11-07 07:52:02,884 INFO L226 Difference]: Without dead ends: 118 [2024-11-07 07:52:02,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-11-07 07:52:02,885 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 105 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 07:52:02,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 350 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 07:52:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-07 07:52:02,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 81. [2024-11-07 07:52:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 07:52:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2024-11-07 07:52:02,907 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 98 [2024-11-07 07:52:02,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:52:02,908 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2024-11-07 07:52:02,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:52:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2024-11-07 07:52:02,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 07:52:02,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:52:02,909 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:52:02,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 07:52:03,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:52:03,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:52:03,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:52:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash 285023154, now seen corresponding path program 1 times [2024-11-07 07:52:03,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:52:03,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610399191] [2024-11-07 07:52:03,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:52:03,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:52:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:03,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:52:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:03,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:52:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:03,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:52:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:03,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:52:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:03,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:52:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:03,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:52:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:03,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:52:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:03,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:52:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:03,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:52:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:03,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:52:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:03,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:52:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:03,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:52:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:52:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:03,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:52:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:52:03,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:52:03,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610399191] [2024-11-07 07:52:03,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610399191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:52:03,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:52:03,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 07:52:03,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472196585] [2024-11-07 07:52:03,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:52:03,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:52:03,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:52:03,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:52:03,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:52:03,708 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:52:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:52:03,912 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2024-11-07 07:52:03,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:52:03,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-07 07:52:03,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:52:03,915 INFO L225 Difference]: With dead ends: 149 [2024-11-07 07:52:03,915 INFO L226 Difference]: Without dead ends: 147 [2024-11-07 07:52:03,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-07 07:52:03,916 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 79 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:52:03,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 443 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:52:03,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-07 07:52:03,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2024-11-07 07:52:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.18348623853211) internal successors, (129), 110 states have internal predecessors, (129), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 07:52:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 165 transitions. [2024-11-07 07:52:03,931 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 165 transitions. Word has length 98 [2024-11-07 07:52:03,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:52:03,932 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 165 transitions. [2024-11-07 07:52:03,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:52:03,932 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 165 transitions. [2024-11-07 07:52:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 07:52:03,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:52:03,933 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:52:03,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 07:52:03,933 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:52:03,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:52:03,933 INFO L85 PathProgramCache]: Analyzing trace with hash 307006281, now seen corresponding path program 1 times [2024-11-07 07:52:03,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:52:03,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106787463] [2024-11-07 07:52:03,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:52:03,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:52:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:03,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:52:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:03,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:52:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:04,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:52:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:04,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:52:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:04,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:52:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:04,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:52:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:04,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:52:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:04,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:52:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:04,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:52:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:04,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:52:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:04,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:52:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:04,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:52:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:04,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:52:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:04,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:52:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:52:04,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:52:04,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106787463] [2024-11-07 07:52:04,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106787463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:52:04,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:52:04,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:52:04,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630157821] [2024-11-07 07:52:04,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:52:04,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:52:04,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:52:04,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:52:04,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:52:04,026 INFO L87 Difference]: Start difference. First operand 131 states and 165 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:52:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:52:04,063 INFO L93 Difference]: Finished difference Result 277 states and 346 transitions. [2024-11-07 07:52:04,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:52:04,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-07 07:52:04,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:52:04,069 INFO L225 Difference]: With dead ends: 277 [2024-11-07 07:52:04,070 INFO L226 Difference]: Without dead ends: 149 [2024-11-07 07:52:04,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:52:04,071 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 15 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:52:04,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 141 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:52:04,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-07 07:52:04,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2024-11-07 07:52:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.1559633027522935) internal successors, (126), 110 states have internal predecessors, (126), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 07:52:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2024-11-07 07:52:04,089 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 98 [2024-11-07 07:52:04,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:52:04,089 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2024-11-07 07:52:04,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:52:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2024-11-07 07:52:04,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 07:52:04,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:52:04,091 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:52:04,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 07:52:04,091 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:52:04,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:52:04,091 INFO L85 PathProgramCache]: Analyzing trace with hash 937286957, now seen corresponding path program 1 times [2024-11-07 07:52:04,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:52:04,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887505733] [2024-11-07 07:52:04,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:52:04,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:52:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:52:04,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255730472] [2024-11-07 07:52:04,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:52:04,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:52:04,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:52:04,152 INFO L229 MonitoredProcess]: Starting monitored process 5 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 07:52:04,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 07:52:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:04,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-07 07:52:04,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:52:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 07:52:05,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:52:05,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:52:05,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887505733] [2024-11-07 07:52:05,498 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 07:52:05,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255730472] [2024-11-07 07:52:05,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255730472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:52:05,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:52:05,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 07:52:05,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583753857] [2024-11-07 07:52:05,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:52:05,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 07:52:05,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:52:05,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 07:52:05,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-07 07:52:05,500 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 07:52:06,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:52:06,720 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2024-11-07 07:52:06,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 07:52:06,721 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 99 [2024-11-07 07:52:06,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:52:06,722 INFO L225 Difference]: With dead ends: 168 [2024-11-07 07:52:06,722 INFO L226 Difference]: Without dead ends: 166 [2024-11-07 07:52:06,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2024-11-07 07:52:06,723 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 134 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 07:52:06,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 342 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 07:52:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-07 07:52:06,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 122. [2024-11-07 07:52:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.15) internal successors, (115), 101 states have internal predecessors, (115), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 07:52:06,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2024-11-07 07:52:06,734 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 99 [2024-11-07 07:52:06,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:52:06,735 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2024-11-07 07:52:06,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 07:52:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2024-11-07 07:52:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 07:52:06,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:52:06,736 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:52:06,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 07:52:06,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 07:52:06,937 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:52:06,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:52:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash -342576721, now seen corresponding path program 1 times [2024-11-07 07:52:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:52:06,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533176633] [2024-11-07 07:52:06,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:52:06,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:52:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:07,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:52:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:07,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:52:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:07,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:52:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:07,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:52:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:07,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:52:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:07,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:52:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:07,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:52:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:07,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:52:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:07,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:52:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:07,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:52:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:07,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:52:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:07,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:52:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:07,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:52:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:07,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:52:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:52:07,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:52:07,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533176633] [2024-11-07 07:52:07,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533176633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:52:07,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:52:07,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 07:52:07,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997066403] [2024-11-07 07:52:07,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:52:07,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 07:52:07,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:52:07,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 07:52:07,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:52:07,579 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:52:07,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:52:07,818 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2024-11-07 07:52:07,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:52:07,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2024-11-07 07:52:07,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:52:07,819 INFO L225 Difference]: With dead ends: 138 [2024-11-07 07:52:07,819 INFO L226 Difference]: Without dead ends: 136 [2024-11-07 07:52:07,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-07 07:52:07,820 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 51 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:52:07,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 507 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:52:07,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-07 07:52:07,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2024-11-07 07:52:07,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 84 states have internal predecessors, (97), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 07:52:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2024-11-07 07:52:07,829 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 99 [2024-11-07 07:52:07,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:52:07,829 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions. [2024-11-07 07:52:07,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:52:07,829 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2024-11-07 07:52:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 07:52:07,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:52:07,830 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:52:07,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 07:52:07,830 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:52:07,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:52:07,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1653714623, now seen corresponding path program 1 times [2024-11-07 07:52:07,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:52:07,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480517463] [2024-11-07 07:52:07,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:52:07,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:52:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:52:07,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [17086961] [2024-11-07 07:52:07,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:52:07,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:52:07,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:52:07,857 INFO L229 MonitoredProcess]: Starting monitored process 6 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 07:52:07,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 07:52:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:52:07,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:52:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:52:07,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 07:52:07,999 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 07:52:08,000 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:52:08,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-07 07:52:08,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-07 07:52:08,206 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:52:08,282 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:52:08,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:52:08 BoogieIcfgContainer [2024-11-07 07:52:08,289 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:52:08,299 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:52:08,299 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:52:08,299 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:52:08,300 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:51:52" (3/4) ... [2024-11-07 07:52:08,302 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 07:52:08,303 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:52:08,304 INFO L158 Benchmark]: Toolchain (without parser) took 16612.10ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 91.5MB in the beginning and 211.7MB in the end (delta: -120.2MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-11-07 07:52:08,304 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:52:08,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.70ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 79.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:52:08,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.39ms. Allocated memory is still 117.4MB. Free memory was 79.1MB in the beginning and 77.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:52:08,304 INFO L158 Benchmark]: Boogie Preprocessor took 64.56ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 75.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:52:08,305 INFO L158 Benchmark]: RCFGBuilder took 478.64ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 60.2MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:52:08,305 INFO L158 Benchmark]: TraceAbstraction took 15776.76ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 59.6MB in the beginning and 80.5MB in the end (delta: -20.9MB). Peak memory consumption was 98.8MB. Max. memory is 16.1GB. [2024-11-07 07:52:08,305 INFO L158 Benchmark]: Witness Printer took 4.54ms. Allocated memory is still 243.3MB. Free memory was 211.8MB in the beginning and 211.7MB in the end (delta: 94.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:52:08,308 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.70ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 79.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.39ms. Allocated memory is still 117.4MB. Free memory was 79.1MB in the beginning and 77.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.56ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 75.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 478.64ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 60.2MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15776.76ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 59.6MB in the beginning and 80.5MB in the end (delta: -20.9MB). Peak memory consumption was 98.8MB. Max. memory is 16.1GB. * Witness Printer took 4.54ms. Allocated memory is still 243.3MB. Free memory was 211.8MB in the beginning and 211.7MB in the end (delta: 94.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] signed char var_1_3 = 0; [L24] signed char var_1_4 = 64; [L25] signed char var_1_5 = 64; [L26] signed long int var_1_6 = -64; [L27] signed long int var_1_8 = 32; [L28] signed long int var_1_9 = 1; [L29] unsigned short int var_1_10 = 32; [L30] signed long int var_1_11 = 15; [L31] unsigned char var_1_12 = 0; [L32] unsigned char var_1_13 = 0; [L33] unsigned short int last_1_var_1_10 = 32; VAL [isInitial=0, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] CALL updateLastVariables() [L88] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_char() [L66] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L66] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L67] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L67] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L68] var_1_4 = __VERIFIER_nondet_char() [L69] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L69] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L70] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L71] var_1_5 = __VERIFIER_nondet_char() [L72] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L72] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L73] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L74] var_1_8 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L75] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L76] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L77] var_1_9 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L78] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L79] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L79] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L80] var_1_11 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L81] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L82] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L82] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L83] var_1_13 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L84] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L85] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L85] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L99] RET updateVariables() [L100] CALL step() [L37] signed long int stepLocal_0 = (((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10)); VAL [isInitial=1, last_1_var_1_10=32, stepLocal_0=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L38] EXPR last_1_var_1_10 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_0=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L38] COND FALSE !(stepLocal_0 <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) [L45] var_1_6 = var_1_5 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L47] signed long int stepLocal_1 = var_1_5 + var_1_6; VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L48] COND FALSE !(var_1_11 < var_1_9) VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L55] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L56] COND TRUE ! var_1_12 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L57] COND TRUE ! var_1_12 [L58] var_1_1 = (var_1_3 + -32) VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR ((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L91] EXPR last_1_var_1_10 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L91] EXPR ((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L91-L92] return ((((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5)))) && ((var_1_11 < var_1_9) ? (((var_1_5 + var_1_6) <= (~ (var_1_6 % -32))) ? (var_1_10 == ((unsigned short int) var_1_5)) : (var_1_10 == ((unsigned short int) var_1_5))) : 1)) && (var_1_12 == ((unsigned char) var_1_13)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.6s, OverallIterations: 13, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 861 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 801 mSDsluCounter, 3471 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2595 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2894 IncrementalHoareTripleChecker+Invalid, 2977 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 876 mSDtfsCounter, 2894 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 714 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=9, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 293 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1754 NumberOfCodeBlocks, 1754 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1152 ConstructedInterpolants, 2 QuantifiedInterpolants, 4319 SizeOfPredicates, 40 NumberOfNonLiveVariables, 924 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 4368/4368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 07:52:08,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_floatingpointinfluence_no-floats_file-79.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 434b16a64b06ae36ef836c68b9042912d6cf793be5a1688bb3a25d59d1194c23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:52:10,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:52:10,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 07:52:10,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:52:10,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:52:10,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:52:10,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:52:10,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:52:10,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:52:10,780 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:52:10,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:52:10,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:52:10,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:52:10,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:52:10,782 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:52:10,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:52:10,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:52:10,782 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:52:10,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:52:10,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:52:10,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:52:10,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:52:10,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:52:10,783 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 07:52:10,784 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 07:52:10,784 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:52:10,784 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 07:52:10,784 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:52:10,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:52:10,784 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:52:10,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:52:10,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:52:10,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:52:10,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:52:10,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:52:10,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:52:10,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:52:10,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:52:10,786 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 07:52:10,786 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 07:52:10,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:52:10,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:52:10,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:52:10,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:52:10,787 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 -> 434b16a64b06ae36ef836c68b9042912d6cf793be5a1688bb3a25d59d1194c23 [2024-11-07 07:52:11,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:52:11,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:52:11,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:52:11,089 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:52:11,089 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:52:11,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-07 07:52:12,413 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:52:12,664 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:52:12,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-07 07:52:12,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/edcee0da8/76e779aa415844faa75c683b17a10e82/FLAG357e71e37 [2024-11-07 07:52:12,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/edcee0da8/76e779aa415844faa75c683b17a10e82 [2024-11-07 07:52:12,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:52:12,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:52:12,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:52:12,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:52:12,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:52:12,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:52:12" (1/1) ... [2024-11-07 07:52:12,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f3ee397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:12, skipping insertion in model container [2024-11-07 07:52:12,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:52:12" (1/1) ... [2024-11-07 07:52:12,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:52:12,861 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_floatingpointinfluence_no-floats_file-79.i[916,929] [2024-11-07 07:52:12,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:52:12,930 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:52:12,941 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_floatingpointinfluence_no-floats_file-79.i[916,929] [2024-11-07 07:52:12,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:52:12,985 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:52:12,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:12 WrapperNode [2024-11-07 07:52:12,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:52:12,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:52:12,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:52:12,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:52:12,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:12" (1/1) ... [2024-11-07 07:52:13,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:12" (1/1) ... [2024-11-07 07:52:13,035 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-11-07 07:52:13,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:52:13,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:52:13,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:52:13,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:52:13,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:12" (1/1) ... [2024-11-07 07:52:13,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:12" (1/1) ... [2024-11-07 07:52:13,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:12" (1/1) ... [2024-11-07 07:52:13,075 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:52:13,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:12" (1/1) ... [2024-11-07 07:52:13,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:12" (1/1) ... [2024-11-07 07:52:13,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:12" (1/1) ... [2024-11-07 07:52:13,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:12" (1/1) ... [2024-11-07 07:52:13,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:12" (1/1) ... [2024-11-07 07:52:13,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:12" (1/1) ... [2024-11-07 07:52:13,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:52:13,106 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:52:13,107 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:52:13,107 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:52:13,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:12" (1/1) ... [2024-11-07 07:52:13,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:52:13,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:52:13,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:52:13,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:52:13,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:52:13,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 07:52:13,172 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:52:13,172 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:52:13,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:52:13,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:52:13,258 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:52:13,259 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:52:13,447 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 07:52:13,447 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:52:13,460 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:52:13,460 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:52:13,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:52:13 BoogieIcfgContainer [2024-11-07 07:52:13,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:52:13,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:52:13,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:52:13,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:52:13,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:52:12" (1/3) ... [2024-11-07 07:52:13,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4953dd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:52:13, skipping insertion in model container [2024-11-07 07:52:13,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:52:12" (2/3) ... [2024-11-07 07:52:13,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4953dd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:52:13, skipping insertion in model container [2024-11-07 07:52:13,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:52:13" (3/3) ... [2024-11-07 07:52:13,475 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-07 07:52:13,486 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:52:13,486 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:52:13,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:52:13,557 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;@523594f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:52:13,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:52:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 07:52:13,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 07:52:13,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:52:13,573 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:52:13,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:52:13,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:52:13,579 INFO L85 PathProgramCache]: Analyzing trace with hash 416337941, now seen corresponding path program 1 times [2024-11-07 07:52:13,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:52:13,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656925202] [2024-11-07 07:52:13,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:52:13,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:52:13,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:52:13,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:52:13,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 07:52:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:13,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 07:52:13,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:52:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-07 07:52:13,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:52:13,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:52:13,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656925202] [2024-11-07 07:52:13,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656925202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:52:13,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:52:13,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:52:13,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052673555] [2024-11-07 07:52:13,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:52:13,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:52:13,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:52:13,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:52:13,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:52:13,817 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 07:52:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:52:13,837 INFO L93 Difference]: Finished difference Result 89 states and 148 transitions. [2024-11-07 07:52:13,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:52:13,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2024-11-07 07:52:13,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:52:13,843 INFO L225 Difference]: With dead ends: 89 [2024-11-07 07:52:13,843 INFO L226 Difference]: Without dead ends: 44 [2024-11-07 07:52:13,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:52:13,848 INFO L432 NwaCegarLoop]: 63 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, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:52:13,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:52:13,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-07 07:52:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-07 07:52:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 07:52:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2024-11-07 07:52:13,890 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 91 [2024-11-07 07:52:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:52:13,890 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2024-11-07 07:52:13,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 07:52:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2024-11-07 07:52:13,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 07:52:13,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:52:13,895 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:52:13,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 07:52:14,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:52:14,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:52:14,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:52:14,098 INFO L85 PathProgramCache]: Analyzing trace with hash 410614101, now seen corresponding path program 1 times [2024-11-07 07:52:14,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:52:14,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457515060] [2024-11-07 07:52:14,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:52:14,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:52:14,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:52:14,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:52:14,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 07:52:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:14,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 07:52:14,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:52:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 07:52:14,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:52:14,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:52:14,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457515060] [2024-11-07 07:52:14,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457515060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:52:14,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:52:14,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:52:14,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799762075] [2024-11-07 07:52:14,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:52:14,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:52:14,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:52:14,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:52:14,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:52:14,352 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:52:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:52:14,637 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2024-11-07 07:52:14,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 07:52:14,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-11-07 07:52:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:52:14,641 INFO L225 Difference]: With dead ends: 93 [2024-11-07 07:52:14,641 INFO L226 Difference]: Without dead ends: 52 [2024-11-07 07:52:14,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-07 07:52:14,643 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 67 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:52:14,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 96 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:52:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-07 07:52:14,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2024-11-07 07:52:14,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 07:52:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2024-11-07 07:52:14,678 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 91 [2024-11-07 07:52:14,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:52:14,679 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2024-11-07 07:52:14,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:52:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-11-07 07:52:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 07:52:14,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:52:14,680 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:52:14,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 07:52:14,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:52:14,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:52:14,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:52:14,882 INFO L85 PathProgramCache]: Analyzing trace with hash -391425056, now seen corresponding path program 1 times [2024-11-07 07:52:14,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:52:14,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782961075] [2024-11-07 07:52:14,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:52:14,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:52:14,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:52:14,886 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:52:14,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 07:52:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:14,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 07:52:14,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:52:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-07 07:52:34,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:52:49,255 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 07:52:49,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:52:49,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782961075] [2024-11-07 07:52:49,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782961075] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 07:52:49,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 07:52:49,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 21 [2024-11-07 07:52:49,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343352699] [2024-11-07 07:52:49,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:52:49,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:52:49,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:52:49,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:52:49,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-11-07 07:52:49,258 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:52:51,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-07 07:52:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:52:58,024 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2024-11-07 07:52:58,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:52:58,028 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-11-07 07:52:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:52:58,030 INFO L225 Difference]: With dead ends: 61 [2024-11-07 07:52:58,030 INFO L226 Difference]: Without dead ends: 59 [2024-11-07 07:52:58,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2024-11-07 07:52:58,031 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 19 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-07 07:52:58,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 267 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-07 07:52:58,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-07 07:52:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-11-07 07:52:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 07:52:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2024-11-07 07:52:58,040 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 92 [2024-11-07 07:52:58,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:52:58,041 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2024-11-07 07:52:58,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 07:52:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2024-11-07 07:52:58,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 07:52:58,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:52:58,042 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:52:58,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 07:52:58,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:52:58,243 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:52:58,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:52:58,244 INFO L85 PathProgramCache]: Analyzing trace with hash 78612323, now seen corresponding path program 1 times [2024-11-07 07:52:58,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:52:58,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100280168] [2024-11-07 07:52:58,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:52:58,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:52:58,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:52:58,247 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:52:58,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 07:52:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:52:58,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 07:52:58,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:53:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-07 07:53:08,694 INFO L311 TraceCheckSpWp]: Computing backward predicates...