./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-7.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_loopvsstraightlinecode_25-while_file-7.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', '75121fbbd1ed27c28a06b51090ae110a04aef15c4da97bde5134404f888e055a'] 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_loopvsstraightlinecode_25-while_file-7.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 75121fbbd1ed27c28a06b51090ae110a04aef15c4da97bde5134404f888e055a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:34:39,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:34:40,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:34:40,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:34:40,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:34:40,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:34:40,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:34:40,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:34:40,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:34:40,058 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:34:40,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:34:40,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:34:40,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:34:40,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:34:40,059 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:34:40,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:34:40,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:34:40,060 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:34:40,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:34:40,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:34:40,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:34:40,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:34:40,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:34:40,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:34:40,061 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:34:40,061 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:34:40,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:34:40,061 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:34:40,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:34:40,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:34:40,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:34:40,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:34:40,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:34:40,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:34:40,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:34:40,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:34:40,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:34:40,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:34:40,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:34:40,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:34:40,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:34:40,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:34:40,062 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 -> 75121fbbd1ed27c28a06b51090ae110a04aef15c4da97bde5134404f888e055a [2024-11-07 08:34:40,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:34:40,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:34:40,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:34:40,356 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:34:40,356 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:34:40,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-7.i [2024-11-07 08:34:41,691 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:34:41,895 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:34:41,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-7.i [2024-11-07 08:34:41,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/613cbc0ee/b632fc658e3a4a92bc87319ce93e71b5/FLAG3719c5514 [2024-11-07 08:34:41,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/613cbc0ee/b632fc658e3a4a92bc87319ce93e71b5 [2024-11-07 08:34:41,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:34:41,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:34:41,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:34:41,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:34:41,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:34:41,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:34:41" (1/1) ... [2024-11-07 08:34:41,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2baf146e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:41, skipping insertion in model container [2024-11-07 08:34:41,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:34:41" (1/1) ... [2024-11-07 08:34:41,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:34:42,050 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_loopvsstraightlinecode_25-while_file-7.i[914,927] [2024-11-07 08:34:42,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:34:42,101 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:34:42,110 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_loopvsstraightlinecode_25-while_file-7.i[914,927] [2024-11-07 08:34:42,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:34:42,136 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:34:42,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:42 WrapperNode [2024-11-07 08:34:42,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:34:42,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:34:42,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:34:42,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:34:42,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:42" (1/1) ... [2024-11-07 08:34:42,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:42" (1/1) ... [2024-11-07 08:34:42,172 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2024-11-07 08:34:42,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:34:42,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:34:42,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:34:42,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:34:42,181 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:42" (1/1) ... [2024-11-07 08:34:42,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:42" (1/1) ... [2024-11-07 08:34:42,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:42" (1/1) ... [2024-11-07 08:34:42,203 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 08:34:42,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:42" (1/1) ... [2024-11-07 08:34:42,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:42" (1/1) ... [2024-11-07 08:34:42,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:42" (1/1) ... [2024-11-07 08:34:42,216 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:42" (1/1) ... [2024-11-07 08:34:42,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:42" (1/1) ... [2024-11-07 08:34:42,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:42" (1/1) ... [2024-11-07 08:34:42,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:34:42,224 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:34:42,224 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:34:42,224 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:34:42,228 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:42" (1/1) ... [2024-11-07 08:34:42,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:34:42,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:34:42,263 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 08:34:42,269 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 08:34:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:34:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:34:42,291 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:34:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:34:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:34:42,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:34:42,352 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:34:42,354 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:34:42,526 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-07 08:34:42,527 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:34:42,536 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:34:42,536 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:34:42,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:34:42 BoogieIcfgContainer [2024-11-07 08:34:42,537 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:34:42,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:34:42,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:34:42,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:34:42,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:34:41" (1/3) ... [2024-11-07 08:34:42,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581bbb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:34:42, skipping insertion in model container [2024-11-07 08:34:42,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:42" (2/3) ... [2024-11-07 08:34:42,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581bbb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:34:42, skipping insertion in model container [2024-11-07 08:34:42,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:34:42" (3/3) ... [2024-11-07 08:34:42,547 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-7.i [2024-11-07 08:34:42,559 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:34:42,559 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:34:42,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:34:42,621 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;@225ace6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:34:42,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:34:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 08:34:42,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 08:34:42,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:34:42,632 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 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 08:34:42,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:34:42,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:34:42,637 INFO L85 PathProgramCache]: Analyzing trace with hash 968799621, now seen corresponding path program 1 times [2024-11-07 08:34:42,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:34:42,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227389660] [2024-11-07 08:34:42,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:34:42,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:34:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:42,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:34:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:42,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:34:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:42,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 08:34:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:42,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 08:34:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:42,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:34:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:42,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 08:34:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 08:34:42,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:34:42,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227389660] [2024-11-07 08:34:42,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227389660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:34:42,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:34:42,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:34:42,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132615697] [2024-11-07 08:34:42,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:34:42,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:34:42,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:34:42,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:34:42,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:34:42,843 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 08:34:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:34:42,858 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2024-11-07 08:34:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:34:42,860 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2024-11-07 08:34:42,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:34:42,864 INFO L225 Difference]: With dead ends: 67 [2024-11-07 08:34:42,865 INFO L226 Difference]: Without dead ends: 33 [2024-11-07 08:34:42,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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 08:34:42,870 INFO L432 NwaCegarLoop]: 43 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, 43 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 08:34:42,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:34:42,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-07 08:34:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-07 08:34:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 08:34:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-07 08:34:42,901 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 48 [2024-11-07 08:34:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:34:42,902 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-07 08:34:42,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 08:34:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-07 08:34:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 08:34:42,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:34:42,905 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 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 08:34:42,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:34:42,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:34:42,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:34:42,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1549515065, now seen corresponding path program 1 times [2024-11-07 08:34:42,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:34:42,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335431397] [2024-11-07 08:34:42,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:34:42,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:34:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:43,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:34:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:43,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:34:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:43,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 08:34:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:43,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 08:34:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:43,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 08:34:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:43,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 08:34:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 08:34:43,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:34:43,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335431397] [2024-11-07 08:34:43,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335431397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:34:43,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:34:43,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:34:43,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204963623] [2024-11-07 08:34:43,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:34:43,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:34:43,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:34:43,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:34:43,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:34:43,297 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:34:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:34:43,335 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2024-11-07 08:34:43,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:34:43,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 48 [2024-11-07 08:34:43,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:34:43,337 INFO L225 Difference]: With dead ends: 63 [2024-11-07 08:34:43,338 INFO L226 Difference]: Without dead ends: 33 [2024-11-07 08:34:43,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:34:43,339 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 35 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:34:43,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 41 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:34:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-07 08:34:43,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-07 08:34:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 08:34:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-11-07 08:34:43,355 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 48 [2024-11-07 08:34:43,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:34:43,356 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-07 08:34:43,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:34:43,356 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-11-07 08:34:43,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-07 08:34:43,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:34:43,357 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 08:34:43,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:34:43,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:34:43,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:34:43,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1025887069, now seen corresponding path program 1 times [2024-11-07 08:34:43,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:34:43,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149237930] [2024-11-07 08:34:43,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:34:43,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:34:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:34:43,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:34:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:34:43,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:34:43,453 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:34:43,454 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:34:43,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:34:43,458 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 08:34:43,480 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:34:43,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:34:43 BoogieIcfgContainer [2024-11-07 08:34:43,485 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:34:43,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:34:43,486 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:34:43,486 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:34:43,487 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:34:42" (3/4) ... [2024-11-07 08:34:43,489 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:34:43,489 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:34:43,490 INFO L158 Benchmark]: Toolchain (without parser) took 1566.04ms. Allocated memory is still 117.4MB. Free memory was 93.9MB in the beginning and 49.4MB in the end (delta: 44.5MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2024-11-07 08:34:43,490 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:34:43,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.72ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 81.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:34:43,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.49ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 79.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:34:43,492 INFO L158 Benchmark]: Boogie Preprocessor took 50.33ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 77.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:34:43,492 INFO L158 Benchmark]: RCFGBuilder took 313.22ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 65.0MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:34:43,492 INFO L158 Benchmark]: TraceAbstraction took 946.30ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 49.4MB in the end (delta: 15.0MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-07 08:34:43,492 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 117.4MB. Free memory was 49.4MB in the beginning and 49.4MB in the end (delta: 26.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:34:43,494 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.24ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.72ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 81.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.49ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 79.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.33ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 77.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 313.22ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 65.0MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 946.30ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 49.4MB in the end (delta: 15.0MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 117.4MB. Free memory was 49.4MB in the beginning and 49.4MB 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 someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] float var_1_2 = 200.875; [L24] float var_1_3 = 8.2; [L25] float var_1_4 = 100000000000.4; [L26] unsigned char var_1_5 = 5; [L27] unsigned long int var_1_6 = 100; [L28] double var_1_9 = 4.6; [L29] double var_1_10 = 2.5; [L30] double last_1_var_1_9 = 4.6; VAL [isInitial=0, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_2=1607/8, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L80] isInitial = 1 [L81] FCALL initially() [L82] COND TRUE 1 [L83] CALL updateLastVariables() [L73] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_2=1607/8, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L83] RET updateLastVariables() [L84] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_float() [L61] 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_9=23/5, var_1_10=5/2, var_1_1=1, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L61] 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_9=23/5, var_1_10=5/2, var_1_1=1, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L62] var_1_3 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L63] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L64] var_1_4 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=5, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=5, var_1_6=100, var_1_9=23/5] [L65] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=5, var_1_6=100, var_1_9=23/5] [L66] var_1_5 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_6=100, var_1_9=23/5] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_6=100, var_1_9=23/5] [L68] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=0, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=0, var_1_6=100, var_1_9=23/5] [L68] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=0, var_1_6=100, var_1_9=23/5] [L69] var_1_10 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_1=1, var_1_5=0, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_1=1, var_1_5=0, var_1_6=100, var_1_9=23/5] [L70] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=1, var_1_5=0, var_1_6=100, var_1_9=23/5] [L84] RET updateVariables() [L85] CALL step() [L34] COND FALSE !(! (last_1_var_1_9 <= (var_1_3 - var_1_4))) [L45] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=0, var_1_5=0, var_1_6=100, var_1_9=23/5] [L47] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=0, var_1_5=0, var_1_6=100, var_1_9=23/5] [L48] COND FALSE !(stepLocal_0 < 0) [L51] var_1_6 = ((((((var_1_5) > (var_1_1)) ? (var_1_5) : (var_1_1))) + ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) + var_1_1) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_9=23/5] [L53] COND TRUE var_1_1 <= var_1_6 VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_9=23/5] [L54] COND TRUE var_1_2 >= var_1_3 [L55] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=100000000005, var_1_1=0, var_1_5=0, var_1_6=0, var_1_9=100000000005] [L85] RET step() [L86] CALL, EXPR property() [L76-L77] return (((! (last_1_var_1_9 <= (var_1_3 - var_1_4))) ? ((last_1_var_1_9 < var_1_3) ? ((! (var_1_3 > last_1_var_1_9)) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && ((var_1_5 < 0) ? (var_1_6 == ((unsigned long int) var_1_5)) : (var_1_6 == ((unsigned long int) ((((((var_1_5) > (var_1_1)) ? (var_1_5) : (var_1_1))) + ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) + var_1_1))))) && ((var_1_1 <= var_1_6) ? ((var_1_2 >= var_1_3) ? (var_1_9 == ((double) var_1_10)) : 1) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_9=23/5, var_1_10=100000000005, var_1_1=0, var_1_5=0, var_1_6=0, var_1_9=100000000005] [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=100000000005, var_1_1=0, var_1_5=0, var_1_6=0, var_1_9=100000000005] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=100000000005, var_1_1=0, var_1_5=0, var_1_6=0, var_1_9=100000000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 83 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 120/120 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 08:34:43,517 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_loopvsstraightlinecode_25-while_file-7.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 75121fbbd1ed27c28a06b51090ae110a04aef15c4da97bde5134404f888e055a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:34:45,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:34:45,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:34:45,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:34:45,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:34:45,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:34:45,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:34:45,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:34:45,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:34:45,446 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:34:45,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:34:45,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:34:45,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:34:45,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:34:45,447 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:34:45,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:34:45,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:34:45,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:34:45,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:34:45,449 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:34:45,449 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:34:45,449 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:34:45,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:34:45,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:34:45,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:34:45,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:34:45,450 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 -> 75121fbbd1ed27c28a06b51090ae110a04aef15c4da97bde5134404f888e055a [2024-11-07 08:34:45,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:34:45,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:34:45,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:34:45,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:34:45,778 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:34:45,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-7.i [2024-11-07 08:34:47,319 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:34:47,519 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:34:47,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-7.i [2024-11-07 08:34:47,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18150e8c1/ea2ee02340b84a8d96ff248a08ee9e0f/FLAG4608f1bb1 [2024-11-07 08:34:47,542 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18150e8c1/ea2ee02340b84a8d96ff248a08ee9e0f [2024-11-07 08:34:47,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:34:47,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:34:47,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:34:47,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:34:47,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:34:47,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:34:47" (1/1) ... [2024-11-07 08:34:47,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aa166b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:47, skipping insertion in model container [2024-11-07 08:34:47,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:34:47" (1/1) ... [2024-11-07 08:34:47,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:34:47,676 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_loopvsstraightlinecode_25-while_file-7.i[914,927] [2024-11-07 08:34:47,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:34:47,722 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:34:47,732 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_loopvsstraightlinecode_25-while_file-7.i[914,927] [2024-11-07 08:34:47,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:34:47,767 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:34:47,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:47 WrapperNode [2024-11-07 08:34:47,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:34:47,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:34:47,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:34:47,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:34:47,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:47" (1/1) ... [2024-11-07 08:34:47,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:47" (1/1) ... [2024-11-07 08:34:47,800 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2024-11-07 08:34:47,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:34:47,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:34:47,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:34:47,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:34:47,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:47" (1/1) ... [2024-11-07 08:34:47,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:47" (1/1) ... [2024-11-07 08:34:47,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:47" (1/1) ... [2024-11-07 08:34:47,824 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 08:34:47,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:47" (1/1) ... [2024-11-07 08:34:47,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:47" (1/1) ... [2024-11-07 08:34:47,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:47" (1/1) ... [2024-11-07 08:34:47,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:47" (1/1) ... [2024-11-07 08:34:47,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:47" (1/1) ... [2024-11-07 08:34:47,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:47" (1/1) ... [2024-11-07 08:34:47,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:34:47,836 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:34:47,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:34:47,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:34:47,837 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:47" (1/1) ... [2024-11-07 08:34:47,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:34:47,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:34:47,863 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 08:34:47,865 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 08:34:47,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:34:47,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:34:47,881 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:34:47,881 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:34:47,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:34:47,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:34:47,928 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:34:47,929 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:34:48,667 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-07 08:34:48,667 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:34:48,675 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:34:48,676 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:34:48,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:34:48 BoogieIcfgContainer [2024-11-07 08:34:48,676 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:34:48,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:34:48,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:34:48,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:34:48,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:34:47" (1/3) ... [2024-11-07 08:34:48,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46eeca60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:34:48, skipping insertion in model container [2024-11-07 08:34:48,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:47" (2/3) ... [2024-11-07 08:34:48,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46eeca60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:34:48, skipping insertion in model container [2024-11-07 08:34:48,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:34:48" (3/3) ... [2024-11-07 08:34:48,684 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-7.i [2024-11-07 08:34:48,695 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:34:48,695 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:34:48,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:34:48,739 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;@2ab0422, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:34:48,741 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:34:48,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 08:34:48,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 08:34:48,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:34:48,749 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 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 08:34:48,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:34:48,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:34:48,754 INFO L85 PathProgramCache]: Analyzing trace with hash 968799621, now seen corresponding path program 1 times [2024-11-07 08:34:48,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:34:48,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602820732] [2024-11-07 08:34:48,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:34:48,763 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 08:34:48,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:34:48,769 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 08:34:48,771 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 08:34:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:48,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:34:48,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:34:48,962 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-07 08:34:48,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:34:48,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:34:48,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602820732] [2024-11-07 08:34:48,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602820732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:34:48,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:34:48,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:34:48,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753958391] [2024-11-07 08:34:48,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:34:48,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:34:48,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:34:48,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:34:48,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:34:48,979 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 08:34:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:34:48,989 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2024-11-07 08:34:48,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:34:48,991 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2024-11-07 08:34:48,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:34:48,994 INFO L225 Difference]: With dead ends: 67 [2024-11-07 08:34:48,994 INFO L226 Difference]: Without dead ends: 33 [2024-11-07 08:34:48,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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 08:34:48,997 INFO L432 NwaCegarLoop]: 43 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, 43 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 08:34:48,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:34:49,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-07 08:34:49,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-07 08:34:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 08:34:49,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-07 08:34:49,033 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 48 [2024-11-07 08:34:49,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:34:49,033 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-07 08:34:49,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 08:34:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-07 08:34:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 08:34:49,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:34:49,035 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 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 08:34:49,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 08:34:49,235 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 08:34:49,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:34:49,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:34:49,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1549515065, now seen corresponding path program 1 times [2024-11-07 08:34:49,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:34:49,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634331616] [2024-11-07 08:34:49,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:34:49,237 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 08:34:49,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:34:49,241 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 08:34:49,242 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 08:34:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:49,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 08:34:49,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:34:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 08:34:49,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:34:49,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:34:49,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634331616] [2024-11-07 08:34:49,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634331616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:34:49,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:34:49,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:34:49,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722265164] [2024-11-07 08:34:49,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:34:49,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:34:49,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:34:49,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:34:49,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:34:49,563 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:34:49,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:34:49,971 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2024-11-07 08:34:49,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:34:49,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 48 [2024-11-07 08:34:49,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:34:49,973 INFO L225 Difference]: With dead ends: 75 [2024-11-07 08:34:49,973 INFO L226 Difference]: Without dead ends: 45 [2024-11-07 08:34:49,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:34:49,974 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 38 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:34:49,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 75 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 08:34:49,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-07 08:34:49,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-11-07 08:34:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 08:34:49,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2024-11-07 08:34:49,982 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 48 [2024-11-07 08:34:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:34:49,982 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2024-11-07 08:34:49,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:34:49,983 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2024-11-07 08:34:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-07 08:34:49,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:34:49,984 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 08:34:49,990 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 08:34:50,184 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 08:34:50,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:34:50,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:34:50,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1025887069, now seen corresponding path program 1 times [2024-11-07 08:34:50,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:34:50,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098286926] [2024-11-07 08:34:50,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:34:50,186 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 08:34:50,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:34:50,188 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 08:34:50,189 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 08:34:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:34:50,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 08:34:50,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:35:12,930 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-07 08:35:12,931 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:35:12,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:35:12,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098286926] [2024-11-07 08:35:12,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098286926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:35:12,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:35:12,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 08:35:12,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565137852] [2024-11-07 08:35:12,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:35:12,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 08:35:12,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:35:12,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 08:35:12,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:35:12,933 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:35:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:35:15,118 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2024-11-07 08:35:15,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 08:35:15,119 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-11-07 08:35:15,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:35:15,120 INFO L225 Difference]: With dead ends: 69 [2024-11-07 08:35:15,120 INFO L226 Difference]: Without dead ends: 67 [2024-11-07 08:35:15,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2024-11-07 08:35:15,123 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 85 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 08:35:15,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 135 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 08:35:15,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-07 08:35:15,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2024-11-07 08:35:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 08:35:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2024-11-07 08:35:15,132 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 49 [2024-11-07 08:35:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:35:15,132 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2024-11-07 08:35:15,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:35:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2024-11-07 08:35:15,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-07 08:35:15,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:35:15,133 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 08:35:15,140 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 08:35:15,337 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 08:35:15,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:35:15,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:35:15,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1024040027, now seen corresponding path program 1 times [2024-11-07 08:35:15,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:35:15,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792541145] [2024-11-07 08:35:15,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:35:15,340 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 08:35:15,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:35:15,347 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 08:35:15,350 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 08:35:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:35:15,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 08:35:15,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:35:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 08:35:25,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:35:25,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:35:25,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792541145] [2024-11-07 08:35:25,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792541145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:35:25,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:35:25,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 08:35:25,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290849859] [2024-11-07 08:35:25,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:35:25,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:35:25,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:35:25,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:35:25,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:35:25,149 INFO L87 Difference]: Start difference. First operand 51 states and 61 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:35:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:35:25,653 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-11-07 08:35:25,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 08:35:25,653 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-11-07 08:35:25,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:35:25,654 INFO L225 Difference]: With dead ends: 55 [2024-11-07 08:35:25,654 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 08:35:25,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 08:35:25,655 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 23 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:35:25,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 208 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 08:35:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 08:35:25,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 08:35:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 08:35:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 08:35:25,655 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2024-11-07 08:35:25,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:35:25,656 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 08:35:25,656 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 08:35:25,656 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 08:35:25,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 08:35:25,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:35:25,668 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 (5)] Ended with exit code 0 [2024-11-07 08:35:25,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 08:35:25,863 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 08:35:25,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 08:35:26,441 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:35:26,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 08:35:26,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 08:35:26,451 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 08:35:26,451 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 08:35:26,451 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 08:35:26,451 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 08:35:26,454 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 08:35:26,454 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 08:35:26,455 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 08:35:26,455 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 08:35:26,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:35:26 BoogieIcfgContainer [2024-11-07 08:35:26,458 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:35:26,459 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:35:26,459 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:35:26,459 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:35:26,460 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:34:48" (3/4) ... [2024-11-07 08:35:26,461 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 08:35:26,465 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 08:35:26,468 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-07 08:35:26,468 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-07 08:35:26,469 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 08:35:26,469 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 08:35:26,528 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 08:35:26,528 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 08:35:26,528 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:35:26,529 INFO L158 Benchmark]: Toolchain (without parser) took 38983.89ms. Allocated memory was 117.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 93.1MB in the beginning and 787.2MB in the end (delta: -694.2MB). Peak memory consumption was 989.1MB. Max. memory is 16.1GB. [2024-11-07 08:35:26,529 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:35:26,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.93ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 80.2MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:35:26,530 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.59ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 78.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:35:26,530 INFO L158 Benchmark]: Boogie Preprocessor took 32.59ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 76.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:35:26,530 INFO L158 Benchmark]: RCFGBuilder took 839.70ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 64.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:35:26,530 INFO L158 Benchmark]: TraceAbstraction took 37779.91ms. Allocated memory was 117.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 63.7MB in the beginning and 792.6MB in the end (delta: -728.9MB). Peak memory consumption was 955.6MB. Max. memory is 16.1GB. [2024-11-07 08:35:26,530 INFO L158 Benchmark]: Witness Printer took 69.38ms. Allocated memory is still 1.8GB. Free memory was 792.6MB in the beginning and 787.2MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:35:26,531 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.15ms. Allocated memory is still 117.4MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.93ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 80.2MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.59ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 78.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.59ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 76.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 839.70ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 64.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 37779.91ms. Allocated memory was 117.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 63.7MB in the beginning and 792.6MB in the end (delta: -728.9MB). Peak memory consumption was 955.6MB. Max. memory is 16.1GB. * Witness Printer took 69.38ms. Allocated memory is still 1.8GB. Free memory was 792.6MB in the beginning and 787.2MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.1s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146 mSDsluCounter, 461 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 278 IncrementalHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 179 mSDtfsCounter, 278 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=3, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 32.5s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 601 SizeOfPredicates, 15 NumberOfNonLiveVariables, 346 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 240/240 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 82]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && ((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (last_1_var_1_9 == \old(last_1_var_1_9)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 08:35:26,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE