./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-11.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-1loop_file-11.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', '4cf4650f742700c06e6fa5ebc534ab82b3cf3ef4f696ea5e846e5553fd9ecb84'] 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-1loop_file-11.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 4cf4650f742700c06e6fa5ebc534ab82b3cf3ef4f696ea5e846e5553fd9ecb84 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:17:27,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:17:27,805 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:17:27,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:17:27,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:17:27,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:17:27,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:17:27,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:17:27,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:17:27,838 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:17:27,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:17:27,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:17:27,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:17:27,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:17:27,839 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:17:27,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:17:27,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:17:27,839 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:17:27,840 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:17:27,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:17:27,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:17:27,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:17:27,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:17:27,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:17:27,841 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:17:27,841 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:17:27,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:17:27,842 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:17:27,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:17:27,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:17:27,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:17:27,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:17:27,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:17:27,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:17:27,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:17:27,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:17:27,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:17:27,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:17:27,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:17:27,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:17:27,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:17:27,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:17:27,843 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 -> 4cf4650f742700c06e6fa5ebc534ab82b3cf3ef4f696ea5e846e5553fd9ecb84 [2024-11-07 08:17:28,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:17:28,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:17:28,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:17:28,133 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:17:28,133 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:17:28,135 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-1loop_file-11.i [2024-11-07 08:17:29,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:17:29,673 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:17:29,675 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-11.i [2024-11-07 08:17:29,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8490bbae/b1b7b213e93246e490e3d8caefbc8c76/FLAGb3b36e055 [2024-11-07 08:17:30,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8490bbae/b1b7b213e93246e490e3d8caefbc8c76 [2024-11-07 08:17:30,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:17:30,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:17:30,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:17:30,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:17:30,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:17:30,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:17:30" (1/1) ... [2024-11-07 08:17:30,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d34833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:30, skipping insertion in model container [2024-11-07 08:17:30,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:17:30" (1/1) ... [2024-11-07 08:17:30,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:17:30,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-11.i[915,928] [2024-11-07 08:17:30,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:17:30,199 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:17:30,208 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-1loop_file-11.i[915,928] [2024-11-07 08:17:30,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:17:30,240 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:17:30,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:30 WrapperNode [2024-11-07 08:17:30,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:17:30,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:17:30,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:17:30,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:17:30,250 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:17:30" (1/1) ... [2024-11-07 08:17:30,257 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:17:30" (1/1) ... [2024-11-07 08:17:30,294 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-07 08:17:30,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:17:30,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:17:30,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:17:30,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:17:30,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:30" (1/1) ... [2024-11-07 08:17:30,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:30" (1/1) ... [2024-11-07 08:17:30,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:30" (1/1) ... [2024-11-07 08:17:30,331 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:17:30,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:30" (1/1) ... [2024-11-07 08:17:30,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:30" (1/1) ... [2024-11-07 08:17:30,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:30" (1/1) ... [2024-11-07 08:17:30,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:30" (1/1) ... [2024-11-07 08:17:30,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:30" (1/1) ... [2024-11-07 08:17:30,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:30" (1/1) ... [2024-11-07 08:17:30,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:17:30,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:17:30,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:17:30,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:17:30,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:30" (1/1) ... [2024-11-07 08:17:30,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:17:30,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:17:30,393 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:17:30,399 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:17:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:17:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:17:30,415 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:17:30,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:17:30,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:17:30,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:17:30,480 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:17:30,481 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:17:30,680 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-07 08:17:30,680 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:17:30,689 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:17:30,690 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:17:30,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:17:30 BoogieIcfgContainer [2024-11-07 08:17:30,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:17:30,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:17:30,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:17:30,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:17:30,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:17:30" (1/3) ... [2024-11-07 08:17:30,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672c3a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:17:30, skipping insertion in model container [2024-11-07 08:17:30,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:30" (2/3) ... [2024-11-07 08:17:30,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672c3a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:17:30, skipping insertion in model container [2024-11-07 08:17:30,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:17:30" (3/3) ... [2024-11-07 08:17:30,699 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-11.i [2024-11-07 08:17:30,710 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:17:30,711 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:17:30,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:17:30,763 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;@4413d2ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:17:30,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:17:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 08:17:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:17:30,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:17:30,776 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:30,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:17:30,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:17:30,780 INFO L85 PathProgramCache]: Analyzing trace with hash 2081123107, now seen corresponding path program 1 times [2024-11-07 08:17:30,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:17:30,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725180273] [2024-11-07 08:17:30,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:30,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:17:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:17:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:17:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:17:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 08:17:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:17:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:17:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:17:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:17:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:17:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:17:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:17:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:17:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:17:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:17:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:17:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:17:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:17:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:17:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 08:17:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 08:17:31,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:17:31,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725180273] [2024-11-07 08:17:31,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725180273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:17:31,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:17:31,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:17:31,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626444758] [2024-11-07 08:17:31,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:17:31,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:17:31,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:17:31,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:17:31,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:17:31,172 INFO L87 Difference]: Start difference. First operand has 58 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 08:17:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:17:31,192 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2024-11-07 08:17:31,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:17:31,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 119 [2024-11-07 08:17:31,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:17:31,199 INFO L225 Difference]: With dead ends: 113 [2024-11-07 08:17:31,199 INFO L226 Difference]: Without dead ends: 54 [2024-11-07 08:17:31,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:17:31,204 INFO L432 NwaCegarLoop]: 83 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, 83 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:17:31,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:17:31,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-07 08:17:31,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-07 08:17:31,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 08:17:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-07 08:17:31,241 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 119 [2024-11-07 08:17:31,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:17:31,242 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-07 08:17:31,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 08:17:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-07 08:17:31,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:17:31,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:17:31,244 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:31,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:17:31,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:17:31,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:17:31,245 INFO L85 PathProgramCache]: Analyzing trace with hash 701959721, now seen corresponding path program 1 times [2024-11-07 08:17:31,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:17:31,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551719070] [2024-11-07 08:17:31,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:31,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:17:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:17:31,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1154500746] [2024-11-07 08:17:31,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:31,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:17:31,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:17:31,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:17:31,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 08:17:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:17:31,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:17:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:17:31,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:17:31,639 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:17:31,641 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:17:31,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 08:17:31,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:17:31,846 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-07 08:17:31,921 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:17:31,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:17:31 BoogieIcfgContainer [2024-11-07 08:17:31,928 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:17:31,929 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:17:31,929 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:17:31,929 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:17:31,930 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:17:30" (3/4) ... [2024-11-07 08:17:31,932 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:17:31,933 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:17:31,934 INFO L158 Benchmark]: Toolchain (without parser) took 1929.38ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 43.2MB in the end (delta: 49.0MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2024-11-07 08:17:31,935 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:17:31,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.78ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 79.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:17:31,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.49ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 77.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:17:31,935 INFO L158 Benchmark]: Boogie Preprocessor took 57.70ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 75.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:17:31,936 INFO L158 Benchmark]: RCFGBuilder took 333.94ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 60.5MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:17:31,936 INFO L158 Benchmark]: TraceAbstraction took 1235.91ms. Allocated memory is still 117.4MB. Free memory was 60.0MB in the beginning and 43.7MB in the end (delta: 16.3MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-11-07 08:17:31,936 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 117.4MB. Free memory was 43.7MB in the beginning and 43.2MB in the end (delta: 503.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:17:31,939 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.28ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.78ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 79.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.49ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 77.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.70ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 75.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 333.94ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 60.5MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1235.91ms. Allocated memory is still 117.4MB. Free memory was 60.0MB in the beginning and 43.7MB in the end (delta: 16.3MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 117.4MB. Free memory was 43.7MB in the beginning and 43.2MB in the end (delta: 503.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] double var_1_2 = 50.75; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] signed char var_1_7 = 10; [L27] float var_1_8 = 32.5; [L28] float var_1_9 = 1000000.7; [L29] float var_1_10 = 1.2; [L30] unsigned short int var_1_11 = 256; [L31] signed long int var_1_12 = -64; [L32] signed long int var_1_13 = -16; [L33] unsigned short int var_1_14 = 56281; [L34] unsigned short int var_1_15 = 32; [L35] float last_1_var_1_8 = 32.5; VAL [isInitial=0, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_2=203/4, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L102] isInitial = 1 [L103] FCALL initially() [L104] int k_loop; [L105] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_2=203/4, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L105] COND TRUE k_loop < 1 [L106] CALL updateLastVariables() [L95] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_2=203/4, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L106] RET updateLastVariables() [L107] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_2 >= 0.0F && 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_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L65] RET assume_abort_if_not((var_1_2 >= 0.0F && 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_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [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_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L68] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L68] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L72] var_1_7 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2, var_1_9=10000007/10] [L73] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2, var_1_9=10000007/10] [L74] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2, var_1_9=10000007/10] [L74] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2, var_1_9=10000007/10] [L75] var_1_9 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L76] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L77] var_1_10 = __VERIFIER_nondet_float() [L78] 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_8=65/2, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L78] 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_8=65/2, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L79] var_1_12 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L80] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L81] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L81] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L82] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L82] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L83] var_1_13 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L84] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L85] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L85] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L86] CALL assume_abort_if_not(var_1_13 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L86] RET assume_abort_if_not(var_1_13 != 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L87] var_1_14 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_14 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L88] RET assume_abort_if_not(var_1_14 >= 32767) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L89] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L89] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L90] var_1_15 = __VERIFIER_nondet_ushort() [L91] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L91] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L92] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L92] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L107] RET updateVariables() [L108] CALL step() [L39] COND FALSE !(last_1_var_1_8 >= var_1_2) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L48] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_8=65/2, stepLocal_0=1, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L49] COND FALSE !((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) VAL [isInitial=1, last_1_var_1_8=65/2, stepLocal_0=1, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L58] signed long int stepLocal_1 = var_1_1 / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))); VAL [isInitial=1, last_1_var_1_8=65/2, stepLocal_0=1, stepLocal_1=-16, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L59] COND TRUE stepLocal_1 < var_1_7 [L60] var_1_11 = (var_1_14 - var_1_15) VAL [isInitial=1, last_1_var_1_8=65/2, stepLocal_0=1, var_1_11=32767, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L108] RET step() [L109] CALL, EXPR property() [L98-L99] return ((((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) ? ((var_1_5 && var_1_6) ? ((var_1_8 < var_1_8) ? (var_1_1 == ((signed char) var_1_7)) : (var_1_1 == ((signed char) var_1_7))) : 1) : 1) && ((last_1_var_1_8 >= var_1_2) ? (var_1_6 ? ((! var_1_5) ? (var_1_8 == ((float) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : (var_1_8 == ((float) var_1_9))) : 1) : 1)) && (((var_1_1 / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13)))) < var_1_7) ? (var_1_11 == ((unsigned short int) (var_1_14 - var_1_15))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_8=65/2, var_1_11=32767, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=32767, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=32767, var_1_12=1, var_1_13=2, var_1_14=-32769, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 83 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 684/684 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:17:31,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-11.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 4cf4650f742700c06e6fa5ebc534ab82b3cf3ef4f696ea5e846e5553fd9ecb84 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:17:34,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:17:34,291 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:17:34,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:17:34,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:17:34,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:17:34,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:17:34,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:17:34,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:17:34,329 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:17:34,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:17:34,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:17:34,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:17:34,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:17:34,332 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:17:34,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:17:34,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:17:34,332 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:17:34,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:17:34,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:17:34,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:17:34,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:17:34,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:17:34,333 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:17:34,333 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:17:34,333 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:17:34,333 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:17:34,333 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:17:34,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:17:34,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:17:34,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:17:34,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:17:34,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:17:34,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:17:34,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:17:34,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:17:34,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:17:34,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:17:34,334 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:17:34,334 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:17:34,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:17:34,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:17:34,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:17:34,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:17:34,334 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 -> 4cf4650f742700c06e6fa5ebc534ab82b3cf3ef4f696ea5e846e5553fd9ecb84 [2024-11-07 08:17:34,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:17:34,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:17:34,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:17:34,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:17:34,629 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:17:34,630 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-1loop_file-11.i [2024-11-07 08:17:35,954 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:17:36,202 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:17:36,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-11.i [2024-11-07 08:17:36,211 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b84e11210/d79b0da65a7445d9855e0782287210d0/FLAGc1612ad29 [2024-11-07 08:17:36,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b84e11210/d79b0da65a7445d9855e0782287210d0 [2024-11-07 08:17:36,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:17:36,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:17:36,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:17:36,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:17:36,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:17:36,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:17:36" (1/1) ... [2024-11-07 08:17:36,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b90db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:36, skipping insertion in model container [2024-11-07 08:17:36,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:17:36" (1/1) ... [2024-11-07 08:17:36,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:17:36,407 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-1loop_file-11.i[915,928] [2024-11-07 08:17:36,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:17:36,474 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:17:36,486 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-1loop_file-11.i[915,928] [2024-11-07 08:17:36,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:17:36,525 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:17:36,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:36 WrapperNode [2024-11-07 08:17:36,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:17:36,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:17:36,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:17:36,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:17:36,536 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:17:36" (1/1) ... [2024-11-07 08:17:36,550 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:17:36" (1/1) ... [2024-11-07 08:17:36,579 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-07 08:17:36,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:17:36,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:17:36,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:17:36,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:17:36,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:36" (1/1) ... [2024-11-07 08:17:36,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:36" (1/1) ... [2024-11-07 08:17:36,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:36" (1/1) ... [2024-11-07 08:17:36,621 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:17:36,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:36" (1/1) ... [2024-11-07 08:17:36,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:36" (1/1) ... [2024-11-07 08:17:36,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:36" (1/1) ... [2024-11-07 08:17:36,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:36" (1/1) ... [2024-11-07 08:17:36,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:36" (1/1) ... [2024-11-07 08:17:36,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:36" (1/1) ... [2024-11-07 08:17:36,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:17:36,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:17:36,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:17:36,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:17:36,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:36" (1/1) ... [2024-11-07 08:17:36,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:17:36,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:17:36,689 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:17:36,692 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:17:36,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:17:36,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:17:36,716 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:17:36,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:17:36,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:17:36,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:17:36,796 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:17:36,798 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:17:49,440 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-07 08:17:49,441 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:17:49,448 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:17:49,448 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:17:49,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:17:49 BoogieIcfgContainer [2024-11-07 08:17:49,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:17:49,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:17:49,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:17:49,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:17:49,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:17:36" (1/3) ... [2024-11-07 08:17:49,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc7217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:17:49, skipping insertion in model container [2024-11-07 08:17:49,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:36" (2/3) ... [2024-11-07 08:17:49,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc7217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:17:49, skipping insertion in model container [2024-11-07 08:17:49,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:17:49" (3/3) ... [2024-11-07 08:17:49,458 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-11.i [2024-11-07 08:17:49,472 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:17:49,472 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:17:49,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:17:49,535 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;@3d5c7cf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:17:49,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:17:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 08:17:49,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:17:49,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:17:49,554 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:49,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:17:49,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:17:49,562 INFO L85 PathProgramCache]: Analyzing trace with hash 2081123107, now seen corresponding path program 1 times [2024-11-07 08:17:49,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:17:49,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574039130] [2024-11-07 08:17:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:49,575 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:17:49,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:17:49,577 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:17:49,580 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:17:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:50,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:17:50,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:17:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-07 08:17:50,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:17:50,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:17:50,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574039130] [2024-11-07 08:17:50,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574039130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:17:50,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:17:50,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:17:50,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941982555] [2024-11-07 08:17:50,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:17:50,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:17:50,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:17:50,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:17:50,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:17:50,194 INFO L87 Difference]: Start difference. First operand has 58 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 08:17:50,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:17:50,240 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2024-11-07 08:17:50,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:17:50,243 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 119 [2024-11-07 08:17:50,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:17:50,250 INFO L225 Difference]: With dead ends: 113 [2024-11-07 08:17:50,251 INFO L226 Difference]: Without dead ends: 54 [2024-11-07 08:17:50,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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:17:50,258 INFO L432 NwaCegarLoop]: 82 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, 82 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:17:50,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:17:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-07 08:17:50,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-07 08:17:50,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 08:17:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-11-07 08:17:50,310 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 119 [2024-11-07 08:17:50,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:17:50,310 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-11-07 08:17:50,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 08:17:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-11-07 08:17:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:17:50,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:17:50,318 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:50,342 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:17:50,518 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:17:50,519 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:17:50,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:17:50,520 INFO L85 PathProgramCache]: Analyzing trace with hash 701959721, now seen corresponding path program 1 times [2024-11-07 08:17:50,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:17:50,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123127933] [2024-11-07 08:17:50,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:50,521 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:17:50,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:17:50,523 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:17:50,524 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:17:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:51,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 08:17:51,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:17:59,856 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 08:18:08,079 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 08:18:12,146 WARN L851 $PredicateComparison]: unable to prove that (and (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (not (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_8~0) c_~var_1_2~0))) is different from false [2024-11-07 08:18:16,208 WARN L873 $PredicateComparison]: unable to prove that (and (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (not (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_8~0) c_~var_1_2~0))) is different from true [2024-11-07 08:18:24,360 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 08:18:32,594 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 08:18:40,756 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 08:18:49,014 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 08:18:57,271 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 08:19:01,354 WARN L851 $PredicateComparison]: unable to prove that (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) ((_ zero_extend 16) c_~var_1_14~0))) c_~var_1_11~0) (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (not (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_8~0) c_~var_1_2~0))) is different from false [2024-11-07 08:19:05,424 WARN L873 $PredicateComparison]: unable to prove that (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) ((_ zero_extend 16) c_~var_1_14~0))) c_~var_1_11~0) (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (not (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_8~0) c_~var_1_2~0))) is different from true