./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-46.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_operatoramount_amount25_file-46.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', 'ee31227ad27ad39acff6b0aaf8fcd87c03115ab52de32946a18b44c8bd24cced'] 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_operatoramount_amount25_file-46.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 ee31227ad27ad39acff6b0aaf8fcd87c03115ab52de32946a18b44c8bd24cced --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:30:52,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:30:52,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 09:30:52,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:30:52,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:30:52,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:30:52,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:30:52,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:30:52,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:30:52,517 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:30:52,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:30:52,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:30:52,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:30:52,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:30:52,518 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:30:52,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:30:52,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:30:52,518 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:30:52,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:30:52,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:30:52,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:30:52,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:30:52,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:30:52,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:30:52,521 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:30:52,521 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:30:52,521 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:30:52,521 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:30:52,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:30:52,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:30:52,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:30:52,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:30:52,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:30:52,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:30:52,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:30:52,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:30:52,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:30:52,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:30:52,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:30:52,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:30:52,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:30:52,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:30:52,523 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 -> ee31227ad27ad39acff6b0aaf8fcd87c03115ab52de32946a18b44c8bd24cced [2024-11-07 09:30:52,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:30:52,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:30:52,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:30:52,794 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:30:52,794 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:30:52,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-46.i [2024-11-07 09:30:53,981 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:30:54,230 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:30:54,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-46.i [2024-11-07 09:30:54,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a0370143/37a1b87dd5c44a13a0a596576f3cc9fa/FLAG597a6b4a4 [2024-11-07 09:30:54,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a0370143/37a1b87dd5c44a13a0a596576f3cc9fa [2024-11-07 09:30:54,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:30:54,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:30:54,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:30:54,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:30:54,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:30:54,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:30:54" (1/1) ... [2024-11-07 09:30:54,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68600cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:54, skipping insertion in model container [2024-11-07 09:30:54,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:30:54" (1/1) ... [2024-11-07 09:30:54,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:30:54,694 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_operatoramount_amount25_file-46.i[915,928] [2024-11-07 09:30:54,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:30:54,751 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:30:54,762 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_operatoramount_amount25_file-46.i[915,928] [2024-11-07 09:30:54,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:30:54,784 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:30:54,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:54 WrapperNode [2024-11-07 09:30:54,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:30:54,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:30:54,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:30:54,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:30:54,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:54" (1/1) ... [2024-11-07 09:30:54,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:54" (1/1) ... [2024-11-07 09:30:54,827 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-11-07 09:30:54,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:30:54,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:30:54,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:30:54,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:30:54,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:54" (1/1) ... [2024-11-07 09:30:54,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:54" (1/1) ... [2024-11-07 09:30:54,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:54" (1/1) ... [2024-11-07 09:30:54,862 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 09:30:54,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:54" (1/1) ... [2024-11-07 09:30:54,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:54" (1/1) ... [2024-11-07 09:30:54,868 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:54" (1/1) ... [2024-11-07 09:30:54,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:54" (1/1) ... [2024-11-07 09:30:54,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:54" (1/1) ... [2024-11-07 09:30:54,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:54" (1/1) ... [2024-11-07 09:30:54,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:30:54,874 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:30:54,874 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:30:54,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:30:54,875 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:54" (1/1) ... [2024-11-07 09:30:54,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:30:54,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:30:54,902 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 09:30:54,905 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 09:30:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:30:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:30:54,920 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:30:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:30:54,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:30:54,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:30:54,968 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:30:54,969 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:30:55,141 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 09:30:55,142 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:30:55,154 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:30:55,156 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:30:55,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:30:55 BoogieIcfgContainer [2024-11-07 09:30:55,156 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:30:55,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:30:55,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:30:55,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:30:55,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:30:54" (1/3) ... [2024-11-07 09:30:55,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a6b976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:30:55, skipping insertion in model container [2024-11-07 09:30:55,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:54" (2/3) ... [2024-11-07 09:30:55,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a6b976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:30:55, skipping insertion in model container [2024-11-07 09:30:55,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:30:55" (3/3) ... [2024-11-07 09:30:55,165 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-46.i [2024-11-07 09:30:55,177 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:30:55,178 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:30:55,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:30:55,221 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;@48a17ec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:30:55,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:30:55,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 09:30:55,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 09:30:55,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:30:55,231 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:55,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:30:55,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:30:55,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1832989103, now seen corresponding path program 1 times [2024-11-07 09:30:55,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:30:55,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535535826] [2024-11-07 09:30:55,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:30:55,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:30:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:55,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:30:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:55,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 09:30:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:55,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:30:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:55,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:30:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:55,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:30:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:55,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:30:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:55,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:30:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:55,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:30:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:55,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:30:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:55,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:30:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 09:30:55,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:30:55,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535535826] [2024-11-07 09:30:55,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535535826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:30:55,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:30:55,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:30:55,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572071567] [2024-11-07 09:30:55,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:30:55,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:30:55,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:30:55,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:30:55,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:30:55,414 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 09:30:55,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:30:55,428 INFO L93 Difference]: Finished difference Result 79 states and 128 transitions. [2024-11-07 09:30:55,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:30:55,429 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2024-11-07 09:30:55,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:30:55,434 INFO L225 Difference]: With dead ends: 79 [2024-11-07 09:30:55,434 INFO L226 Difference]: Without dead ends: 39 [2024-11-07 09:30:55,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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 09:30:55,438 INFO L432 NwaCegarLoop]: 55 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, 55 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 09:30:55,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:30:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-07 09:30:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-07 09:30:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 09:30:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2024-11-07 09:30:55,502 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 69 [2024-11-07 09:30:55,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:30:55,502 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2024-11-07 09:30:55,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 09:30:55,503 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2024-11-07 09:30:55,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 09:30:55,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:30:55,504 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:30:55,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:30:55,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:30:55,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:30:55,505 INFO L85 PathProgramCache]: Analyzing trace with hash -462961843, now seen corresponding path program 1 times [2024-11-07 09:30:55,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:30:55,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600266523] [2024-11-07 09:30:55,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:30:55,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:30:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 09:30:55,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494500002] [2024-11-07 09:30:55,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:30:55,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:30:55,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:30:55,611 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 09:30:55,612 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 09:30:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:30:55,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 09:30:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:30:55,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 09:30:55,803 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 09:30:55,804 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:30:55,821 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 09:30:56,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:30:56,009 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-07 09:30:56,047 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:30:56,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:30:56 BoogieIcfgContainer [2024-11-07 09:30:56,051 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:30:56,052 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:30:56,052 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:30:56,052 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:30:56,053 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:30:55" (3/4) ... [2024-11-07 09:30:56,055 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 09:30:56,056 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:30:56,056 INFO L158 Benchmark]: Toolchain (without parser) took 1486.39ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 70.0MB in the end (delta: 23.5MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-11-07 09:30:56,057 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:30:56,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.62ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 81.1MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:30:56,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.32ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 79.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:30:56,058 INFO L158 Benchmark]: Boogie Preprocessor took 41.77ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 76.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:30:56,059 INFO L158 Benchmark]: RCFGBuilder took 282.06ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 62.3MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 09:30:56,059 INFO L158 Benchmark]: TraceAbstraction took 893.03ms. Allocated memory is still 117.4MB. Free memory was 61.8MB in the beginning and 70.0MB in the end (delta: -8.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:30:56,060 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 117.4MB. Free memory was 70.0MB in the beginning and 70.0MB in the end (delta: 26.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:30:56,061 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.65ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.62ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 81.1MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.32ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 79.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.77ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 76.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 282.06ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 62.3MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 893.03ms. Allocated memory is still 117.4MB. Free memory was 61.8MB in the beginning and 70.0MB in the end (delta: -8.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 117.4MB. Free memory was 70.0MB in the beginning and 70.0MB in the end (delta: 26.4kB). 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 someBinaryDOUBLEComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] double var_1_2 = 31.75; [L24] signed char var_1_4 = -8; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_8 = 16; [L28] unsigned char var_1_9 = 8; [L29] signed long int var_1_10 = 256; [L30] signed long int last_1_var_1_10 = 256; VAL [isInitial=0, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_2=127/4, var_1_4=-8, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] CALL updateLastVariables() [L85] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_2=127/4, var_1_4=-8, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L95] RET updateLastVariables() [L96] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_double() [L69] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-8, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-8, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L69] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-8, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L70] var_1_4 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_4 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L71] RET assume_abort_if_not(var_1_4 >= -128) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L72] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L72] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L73] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L73] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L74] var_1_6 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_7=1, var_1_8=16, var_1_9=8] [L75] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_7=1, var_1_8=16, var_1_9=8] [L76] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L76] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L77] var_1_7 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L78] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L79] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L79] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16] [L82] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=1] [L82] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=1] [L96] RET updateVariables() [L97] CALL step() [L34] signed char stepLocal_3 = var_1_4; [L35] unsigned char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_10=256, stepLocal_2=1, stepLocal_3=-4, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=1] [L36] COND TRUE 2 != stepLocal_3 [L37] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_10=256, stepLocal_2=1, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L45] signed long int stepLocal_1 = var_1_8 / var_1_4; [L46] signed long int stepLocal_0 = (((var_1_4) < (var_1_8)) ? (var_1_4) : (var_1_8)); VAL [isInitial=1, last_1_var_1_10=256, stepLocal_0=-4, stepLocal_1=0, stepLocal_2=1, var_1_10=256, var_1_1=1, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L47] COND FALSE !((- var_1_2) >= 16.75) [L58] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_10=256, stepLocal_0=-4, stepLocal_1=0, stepLocal_2=1, var_1_10=256, var_1_1=0, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L60] signed long int stepLocal_4 = var_1_8 * var_1_8; VAL [isInitial=1, last_1_var_1_10=256, stepLocal_0=-4, stepLocal_1=0, stepLocal_2=1, stepLocal_4=1, var_1_10=256, var_1_1=0, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L61] COND FALSE !(0 > stepLocal_4) VAL [isInitial=1, last_1_var_1_10=256, stepLocal_0=-4, stepLocal_1=0, stepLocal_2=1, var_1_10=256, var_1_1=0, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L97] RET step() [L98] CALL, EXPR property() [L88-L89] return ((((- var_1_2) >= 16.75) ? (((var_1_8 / var_1_4) >= var_1_8) ? ((((((var_1_4) < (var_1_8)) ? (var_1_4) : (var_1_8))) > -32) ? (var_1_1 == ((unsigned char) 0)) : (var_1_1 == ((unsigned char) var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) : (var_1_1 == ((unsigned char) var_1_6))) && ((2 != var_1_4) ? (var_1_8 == ((unsigned char) var_1_9)) : (((var_1_9 <= last_1_var_1_10) && var_1_7) ? (var_1_8 == ((unsigned char) 128)) : (var_1_8 == ((unsigned char) var_1_9))))) && ((0 > (var_1_8 * var_1_8)) ? (var_1_1 ? (var_1_10 == ((signed long int) 5)) : 1) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=0, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=0, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=0, var_1_4=-4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 55 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 68 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 180/180 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 09:30:56,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_operatoramount_amount25_file-46.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 ee31227ad27ad39acff6b0aaf8fcd87c03115ab52de32946a18b44c8bd24cced --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:30:58,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:30:58,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 09:30:58,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:30:58,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:30:58,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:30:58,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:30:58,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:30:58,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:30:58,438 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:30:58,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:30:58,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:30:58,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:30:58,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:30:58,439 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:30:58,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:30:58,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:30:58,439 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:30:58,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:30:58,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:30:58,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:30:58,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:30:58,439 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:30:58,439 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 09:30:58,439 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 09:30:58,439 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:30:58,439 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 09:30:58,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:30:58,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:30:58,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:30:58,440 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:30:58,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:30:58,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:30:58,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:30:58,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:30:58,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:30:58,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:30:58,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:30:58,440 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 09:30:58,440 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 09:30:58,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:30:58,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:30:58,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:30:58,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:30:58,440 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 -> ee31227ad27ad39acff6b0aaf8fcd87c03115ab52de32946a18b44c8bd24cced [2024-11-07 09:30:58,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:30:58,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:30:58,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:30:58,741 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:30:58,743 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:30:58,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-46.i [2024-11-07 09:31:00,063 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:31:00,325 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:31:00,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-46.i [2024-11-07 09:31:00,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/186b4c574/ed73b9c31c024588ae72150f6b341d85/FLAG0cf5907f0 [2024-11-07 09:31:00,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/186b4c574/ed73b9c31c024588ae72150f6b341d85 [2024-11-07 09:31:00,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:31:00,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:31:00,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:31:00,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:31:00,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:31:00,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:31:00" (1/1) ... [2024-11-07 09:31:00,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a173cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:00, skipping insertion in model container [2024-11-07 09:31:00,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:31:00" (1/1) ... [2024-11-07 09:31:00,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:31:00,515 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_operatoramount_amount25_file-46.i[915,928] [2024-11-07 09:31:00,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:31:00,577 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:31:00,588 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_operatoramount_amount25_file-46.i[915,928] [2024-11-07 09:31:00,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:31:00,631 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:31:00,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:00 WrapperNode [2024-11-07 09:31:00,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:31:00,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:31:00,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:31:00,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:31:00,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:00" (1/1) ... [2024-11-07 09:31:00,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:00" (1/1) ... [2024-11-07 09:31:00,661 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2024-11-07 09:31:00,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:31:00,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:31:00,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:31:00,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:31:00,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:00" (1/1) ... [2024-11-07 09:31:00,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:00" (1/1) ... [2024-11-07 09:31:00,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:00" (1/1) ... [2024-11-07 09:31:00,691 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 09:31:00,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:00" (1/1) ... [2024-11-07 09:31:00,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:00" (1/1) ... [2024-11-07 09:31:00,704 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:00" (1/1) ... [2024-11-07 09:31:00,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:00" (1/1) ... [2024-11-07 09:31:00,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:00" (1/1) ... [2024-11-07 09:31:00,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:00" (1/1) ... [2024-11-07 09:31:00,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:31:00,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:31:00,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:31:00,712 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:31:00,712 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:00" (1/1) ... [2024-11-07 09:31:00,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:31:00,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:31:00,737 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 09:31:00,741 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 09:31:00,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:31:00,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 09:31:00,756 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:31:00,756 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:31:00,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:31:00,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:31:00,806 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:31:00,808 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:31:01,039 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 09:31:01,039 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:31:01,046 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:31:01,047 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:31:01,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:31:01 BoogieIcfgContainer [2024-11-07 09:31:01,048 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:31:01,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:31:01,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:31:01,054 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:31:01,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:31:00" (1/3) ... [2024-11-07 09:31:01,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211fe74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:31:01, skipping insertion in model container [2024-11-07 09:31:01,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:00" (2/3) ... [2024-11-07 09:31:01,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211fe74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:31:01, skipping insertion in model container [2024-11-07 09:31:01,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:31:01" (3/3) ... [2024-11-07 09:31:01,058 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-46.i [2024-11-07 09:31:01,074 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:31:01,074 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:31:01,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:31:01,134 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;@4bf49243, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:31:01,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:31:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 09:31:01,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 09:31:01,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:31:01,146 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:31:01,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:31:01,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:31:01,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1832989103, now seen corresponding path program 1 times [2024-11-07 09:31:01,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:31:01,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582663746] [2024-11-07 09:31:01,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:31:01,160 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 09:31:01,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:31:01,163 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 09:31:01,165 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 09:31:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:01,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 09:31:01,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:31:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-07 09:31:01,299 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:31:01,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:31:01,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582663746] [2024-11-07 09:31:01,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582663746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:31:01,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:31:01,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:31:01,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305533649] [2024-11-07 09:31:01,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:31:01,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:31:01,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:31:01,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:31:01,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:31:01,341 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:31:01,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:31:01,359 INFO L93 Difference]: Finished difference Result 79 states and 128 transitions. [2024-11-07 09:31:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:31:01,361 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-11-07 09:31:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:31:01,366 INFO L225 Difference]: With dead ends: 79 [2024-11-07 09:31:01,366 INFO L226 Difference]: Without dead ends: 39 [2024-11-07 09:31:01,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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 09:31:01,373 INFO L432 NwaCegarLoop]: 55 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, 55 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 09:31:01,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:31:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-07 09:31:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-07 09:31:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 09:31:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2024-11-07 09:31:01,414 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 69 [2024-11-07 09:31:01,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:31:01,415 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2024-11-07 09:31:01,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:31:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2024-11-07 09:31:01,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 09:31:01,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:31:01,418 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:31:01,426 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 09:31:01,618 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 09:31:01,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:31:01,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:31:01,621 INFO L85 PathProgramCache]: Analyzing trace with hash -462961843, now seen corresponding path program 1 times [2024-11-07 09:31:01,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:31:01,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367114175] [2024-11-07 09:31:01,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:31:01,622 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 09:31:01,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:31:01,626 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 09:31:01,627 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 09:31:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:01,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 09:31:01,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:31:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 09:31:53,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:31:53,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:31:53,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367114175] [2024-11-07 09:31:53,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367114175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:31:53,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:31:53,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 09:31:53,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423904520] [2024-11-07 09:31:53,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:31:53,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 09:31:53,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:31:53,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 09:31:53,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:31:53,874 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:31:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:31:54,231 INFO L93 Difference]: Finished difference Result 71 states and 94 transitions. [2024-11-07 09:31:54,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 09:31:54,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-11-07 09:31:54,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:31:54,232 INFO L225 Difference]: With dead ends: 71 [2024-11-07 09:31:54,232 INFO L226 Difference]: Without dead ends: 69 [2024-11-07 09:31:54,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:31:54,233 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 32 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 09:31:54,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 264 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 09:31:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-07 09:31:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2024-11-07 09:31:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 09:31:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2024-11-07 09:31:54,241 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 69 [2024-11-07 09:31:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:31:54,242 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2024-11-07 09:31:54,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:31:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2024-11-07 09:31:54,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 09:31:54,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:31:54,243 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:31:54,249 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 (3)] Ended with exit code 0 [2024-11-07 09:31:54,444 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 09:31:54,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:31:54,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:31:54,445 INFO L85 PathProgramCache]: Analyzing trace with hash -555837416, now seen corresponding path program 1 times [2024-11-07 09:31:54,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:31:54,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971647341] [2024-11-07 09:31:54,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:31:54,445 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 09:31:54,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:31:54,449 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 09:31:54,450 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 09:31:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:54,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 09:31:54,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:32:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 09:32:18,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:32:18,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:32:18,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971647341] [2024-11-07 09:32:18,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971647341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:32:18,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:32:18,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 09:32:18,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734686015] [2024-11-07 09:32:18,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:32:18,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 09:32:18,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:32:18,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 09:32:18,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:32:18,876 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:20,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:32:20,982 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2024-11-07 09:32:20,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 09:32:20,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 70 [2024-11-07 09:32:20,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:32:20,985 INFO L225 Difference]: With dead ends: 77 [2024-11-07 09:32:20,985 INFO L226 Difference]: Without dead ends: 75 [2024-11-07 09:32:20,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-07 09:32:20,986 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 42 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 09:32:20,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 365 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 09:32:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-07 09:32:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2024-11-07 09:32:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 09:32:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2024-11-07 09:32:21,004 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 70 [2024-11-07 09:32:21,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:32:21,004 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2024-11-07 09:32:21,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:21,005 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2024-11-07 09:32:21,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 09:32:21,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:32:21,006 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:32:21,013 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 09:32:21,207 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 09:32:21,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:32:21,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:32:21,211 INFO L85 PathProgramCache]: Analyzing trace with hash -579933832, now seen corresponding path program 1 times [2024-11-07 09:32:21,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:32:21,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80436106] [2024-11-07 09:32:21,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:21,212 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 09:32:21,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:32:21,214 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 09:32:21,216 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 09:32:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:21,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 09:32:21,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:32:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 93 proven. 9 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-07 09:32:23,597 INFO L311 TraceCheckSpWp]: Computing backward predicates...