./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.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', 'bc4858d1901c3c90630688f631857e35419d28ea39c5c3a06b704467149a98bd'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.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 bc4858d1901c3c90630688f631857e35419d28ea39c5c3a06b704467149a98bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:36:51,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:36:51,974 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:36:51,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:36:51,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:36:52,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:36:52,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:36:52,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:36:52,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:36:52,004 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:36:52,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:36:52,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:36:52,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:36:52,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:36:52,005 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:36:52,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:36:52,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:36:52,006 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:36:52,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:36:52,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:36:52,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:36:52,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:36:52,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:36:52,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:36:52,006 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:36:52,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:36:52,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:36:52,006 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:36:52,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:36:52,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:36:52,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:36:52,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:36:52,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:36:52,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:36:52,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:36:52,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:36:52,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:36:52,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:36:52,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:36:52,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:36:52,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:36:52,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:36:52,008 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 -> bc4858d1901c3c90630688f631857e35419d28ea39c5c3a06b704467149a98bd [2024-11-07 08:36:52,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:36:52,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:36:52,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:36:52,259 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:36:52,259 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:36:52,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i [2024-11-07 08:36:53,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:36:53,568 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:36:53,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i [2024-11-07 08:36:53,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f7bef2cae/729257d2a4d747c19eaf2a555f299780/FLAGead365896 [2024-11-07 08:36:53,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f7bef2cae/729257d2a4d747c19eaf2a555f299780 [2024-11-07 08:36:53,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:36:53,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:36:53,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:36:53,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:36:53,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:36:53,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:36:53" (1/1) ... [2024-11-07 08:36:53,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2be707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:53, skipping insertion in model container [2024-11-07 08:36:53,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:36:53" (1/1) ... [2024-11-07 08:36:53,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:36:54,042 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i[915,928] [2024-11-07 08:36:54,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:36:54,089 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:36:54,099 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i[915,928] [2024-11-07 08:36:54,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:36:54,132 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:36:54,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:54 WrapperNode [2024-11-07 08:36:54,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:36:54,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:36:54,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:36:54,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:36:54,140 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:36:54" (1/1) ... [2024-11-07 08:36:54,150 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:36:54" (1/1) ... [2024-11-07 08:36:54,175 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-07 08:36:54,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:36:54,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:36:54,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:36:54,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:36:54,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:54" (1/1) ... [2024-11-07 08:36:54,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:54" (1/1) ... [2024-11-07 08:36:54,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:54" (1/1) ... [2024-11-07 08:36:54,201 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:36:54,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:54" (1/1) ... [2024-11-07 08:36:54,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:54" (1/1) ... [2024-11-07 08:36:54,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:54" (1/1) ... [2024-11-07 08:36:54,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:54" (1/1) ... [2024-11-07 08:36:54,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:54" (1/1) ... [2024-11-07 08:36:54,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:54" (1/1) ... [2024-11-07 08:36:54,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:36:54,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:36:54,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:36:54,219 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:36:54,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:54" (1/1) ... [2024-11-07 08:36:54,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:36:54,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:36:54,242 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:36:54,244 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:36:54,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:36:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:36:54,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:36:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:36:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:36:54,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:36:54,313 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:36:54,314 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:36:54,494 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-07 08:36:54,494 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:36:54,505 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:36:54,505 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:36:54,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:36:54 BoogieIcfgContainer [2024-11-07 08:36:54,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:36:54,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:36:54,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:36:54,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:36:54,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:36:53" (1/3) ... [2024-11-07 08:36:54,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34022ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:36:54, skipping insertion in model container [2024-11-07 08:36:54,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:54" (2/3) ... [2024-11-07 08:36:54,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34022ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:36:54, skipping insertion in model container [2024-11-07 08:36:54,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:36:54" (3/3) ... [2024-11-07 08:36:54,516 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-88.i [2024-11-07 08:36:54,527 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:36:54,527 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:36:54,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:36:54,584 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;@2e942f19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:36:54,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:36:54,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 08:36:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 08:36:54,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:36:54,597 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:54,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:36:54,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:36:54,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2024490382, now seen corresponding path program 1 times [2024-11-07 08:36:54,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:36:54,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129904520] [2024-11-07 08:36:54,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:36:54,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:36:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:54,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:36:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:54,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:36:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:54,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:36:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:54,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:36:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:54,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:36:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:54,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:36:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:54,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:36:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:54,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:36:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:54,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:36:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:54,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:36:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:54,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:36:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 08:36:54,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:36:54,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129904520] [2024-11-07 08:36:54,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129904520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:36:54,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:36:54,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:36:54,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757107057] [2024-11-07 08:36:54,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:36:54,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:36:54,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:36:54,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:36:54,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:36:54,816 INFO L87 Difference]: Start difference. First operand has 48 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 08:36:54,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:36:54,833 INFO L93 Difference]: Finished difference Result 89 states and 143 transitions. [2024-11-07 08:36:54,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:36:54,835 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2024-11-07 08:36:54,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:36:54,839 INFO L225 Difference]: With dead ends: 89 [2024-11-07 08:36:54,840 INFO L226 Difference]: Without dead ends: 44 [2024-11-07 08:36:54,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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:36:54,844 INFO L432 NwaCegarLoop]: 62 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, 62 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:36:54,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:36:54,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-07 08:36:54,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-07 08:36:54,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 08:36:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2024-11-07 08:36:54,873 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 76 [2024-11-07 08:36:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:36:54,873 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2024-11-07 08:36:54,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 08:36:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2024-11-07 08:36:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 08:36:54,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:36:54,875 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:54,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:36:54,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:36:54,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:36:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash 243866420, now seen corresponding path program 1 times [2024-11-07 08:36:54,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:36:54,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608678213] [2024-11-07 08:36:54,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:36:54,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:36:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:36:54,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:36:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:36:55,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:36:55,085 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:36:55,087 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:36:55,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:36:55,090 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-07 08:36:55,134 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:36:55,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:36:55 BoogieIcfgContainer [2024-11-07 08:36:55,136 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:36:55,137 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:36:55,137 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:36:55,137 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:36:55,138 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:36:54" (3/4) ... [2024-11-07 08:36:55,139 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:36:55,140 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:36:55,140 INFO L158 Benchmark]: Toolchain (without parser) took 1214.60ms. Allocated memory is still 109.1MB. Free memory was 84.9MB in the beginning and 53.7MB in the end (delta: 31.3MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2024-11-07 08:36:55,143 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:36:55,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.98ms. Allocated memory is still 109.1MB. Free memory was 84.8MB in the beginning and 72.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:36:55,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.80ms. Allocated memory is still 109.1MB. Free memory was 72.7MB in the beginning and 71.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:36:55,143 INFO L158 Benchmark]: Boogie Preprocessor took 41.74ms. Allocated memory is still 109.1MB. Free memory was 71.0MB in the beginning and 69.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:36:55,143 INFO L158 Benchmark]: RCFGBuilder took 286.89ms. Allocated memory is still 109.1MB. Free memory was 69.0MB in the beginning and 54.9MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:36:55,144 INFO L158 Benchmark]: TraceAbstraction took 628.01ms. Allocated memory is still 109.1MB. Free memory was 54.4MB in the beginning and 53.7MB in the end (delta: 676.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:36:55,144 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 109.1MB. Free memory was 53.7MB in the beginning and 53.7MB in the end (delta: 34.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:36:55,145 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.41ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.98ms. Allocated memory is still 109.1MB. Free memory was 84.8MB in the beginning and 72.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.80ms. Allocated memory is still 109.1MB. Free memory was 72.7MB in the beginning and 71.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.74ms. Allocated memory is still 109.1MB. Free memory was 71.0MB in the beginning and 69.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 286.89ms. Allocated memory is still 109.1MB. Free memory was 69.0MB in the beginning and 54.9MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 628.01ms. Allocated memory is still 109.1MB. Free memory was 54.4MB in the beginning and 53.7MB in the end (delta: 676.4kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 109.1MB. Free memory was 53.7MB in the beginning and 53.7MB in the end (delta: 34.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -8; [L23] signed char var_1_10 = -64; [L24] unsigned char var_1_11 = 0; [L25] unsigned char var_1_12 = 0; [L26] unsigned char var_1_13 = 1; [L27] unsigned char var_1_14 = 0; [L28] unsigned char var_1_15 = 0; [L29] signed long int var_1_16 = -16; [L30] float var_1_17 = 3.5; [L31] float var_1_18 = 128.45; [L32] unsigned long int var_1_19 = 50; [L33] unsigned long int var_1_20 = 25; VAL [isInitial=0, var_1_10=-64, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L84] isInitial = 1 [L85] FCALL initially() [L86] COND TRUE 1 [L87] FCALL updateLastVariables() [L88] CALL updateVariables() [L59] var_1_10 = __VERIFIER_nondet_char() [L60] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L60] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L61] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L61] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L62] var_1_12 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L63] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L64] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L64] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L65] var_1_14 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L66] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L67] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L67] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L68] var_1_15 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L69] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L70] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L70] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L71] var_1_18 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=25] [L72] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=25] [L73] var_1_20 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8] [L74] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8] [L75] CALL assume_abort_if_not(var_1_20 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=4] [L75] RET assume_abort_if_not(var_1_20 <= 4294967294) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=4] [L88] RET updateVariables() [L89] CALL step() [L37] var_1_13 = (var_1_14 && var_1_15) [L38] var_1_17 = var_1_18 [L39] var_1_19 = var_1_20 VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=133, var_1_18=133, var_1_19=4, var_1_1=-8, var_1_20=4] [L40] COND TRUE (- (var_1_17 + var_1_17)) > var_1_17 [L41] var_1_11 = var_1_12 VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=133, var_1_18=133, var_1_19=4, var_1_1=-8, var_1_20=4] [L43] var_1_16 = var_1_19 VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=133, var_1_18=133, var_1_19=4, var_1_1=-8, var_1_20=4] [L44] EXPR var_1_16 | var_1_19 VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=133, var_1_18=133, var_1_19=4, var_1_1=-8, var_1_20=4] [L44] COND FALSE !(((var_1_16 | var_1_19) > var_1_16) && var_1_11) [L55] var_1_1 = var_1_10 VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=133, var_1_18=133, var_1_19=4, var_1_1=126, var_1_20=4] [L89] RET step() [L90] CALL, EXPR property() [L80] EXPR var_1_16 | var_1_19 VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=133, var_1_18=133, var_1_19=4, var_1_1=126, var_1_20=4] [L80-L81] return ((((((((var_1_16 | var_1_19) > var_1_16) && var_1_11) ? (((var_1_19 != -16) && (var_1_17 <= (var_1_17 + var_1_17))) ? ((var_1_17 > var_1_17) ? (var_1_1 == ((signed char) var_1_10)) : (var_1_1 == ((signed char) var_1_10))) : (var_1_1 == ((signed char) var_1_10))) : (var_1_1 == ((signed char) var_1_10))) && (((- (var_1_17 + var_1_17)) > var_1_17) ? (var_1_11 == ((unsigned char) var_1_12)) : 1)) && (var_1_13 == ((unsigned char) (var_1_14 && var_1_15)))) && (var_1_16 == ((signed long int) var_1_19))) && (var_1_17 == ((float) var_1_18))) && (var_1_19 == ((unsigned long int) var_1_20)) ; [L90] RET, EXPR property() [L90] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=133, var_1_18=133, var_1_19=4, var_1_1=126, var_1_20=4] [L19] reach_error() VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=133, var_1_18=133, var_1_19=4, var_1_1=126, var_1_20=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 62 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, 62 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 75 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 220/220 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:36:55,166 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-while_file-88.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 bc4858d1901c3c90630688f631857e35419d28ea39c5c3a06b704467149a98bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:36:56,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:36:56,961 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:36:56,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:36:56,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:36:56,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:36:56,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:36:56,993 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:36:56,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:36:56,993 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:36:56,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:36:56,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:36:56,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:36:56,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:36:56,995 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:36:56,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:36:56,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:36:56,995 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:36:56,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:36:56,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:36:56,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:36:56,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:36:56,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:36:56,996 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:36:56,996 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:36:56,996 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:36:56,996 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:36:56,996 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:36:56,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:36:56,996 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:36:56,996 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:36:56,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:36:56,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:36:56,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:36:56,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:36:56,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:36:56,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:36:56,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:36:56,997 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:36:56,997 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:36:56,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:36:56,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:36:56,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:36:56,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:36:56,998 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 -> bc4858d1901c3c90630688f631857e35419d28ea39c5c3a06b704467149a98bd [2024-11-07 08:36:57,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:36:57,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:36:57,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:36:57,248 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:36:57,249 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:36:57,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i [2024-11-07 08:36:58,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:36:58,672 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:36:58,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i [2024-11-07 08:36:58,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94ccd7526/482eaaf2012f4b0491941e2bb6e345ac/FLAG1862706cd [2024-11-07 08:36:59,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94ccd7526/482eaaf2012f4b0491941e2bb6e345ac [2024-11-07 08:36:59,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:36:59,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:36:59,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:36:59,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:36:59,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:36:59,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:36:59" (1/1) ... [2024-11-07 08:36:59,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d95c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:59, skipping insertion in model container [2024-11-07 08:36:59,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:36:59" (1/1) ... [2024-11-07 08:36:59,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:36:59,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i[915,928] [2024-11-07 08:36:59,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:36:59,219 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:36:59,231 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i[915,928] [2024-11-07 08:36:59,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:36:59,258 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:36:59,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:59 WrapperNode [2024-11-07 08:36:59,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:36:59,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:36:59,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:36:59,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:36:59,267 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:36:59" (1/1) ... [2024-11-07 08:36:59,276 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:36:59" (1/1) ... [2024-11-07 08:36:59,288 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-11-07 08:36:59,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:36:59,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:36:59,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:36:59,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:36:59,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:59" (1/1) ... [2024-11-07 08:36:59,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:59" (1/1) ... [2024-11-07 08:36:59,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:59" (1/1) ... [2024-11-07 08:36:59,304 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:36:59,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:59" (1/1) ... [2024-11-07 08:36:59,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:59" (1/1) ... [2024-11-07 08:36:59,309 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:59" (1/1) ... [2024-11-07 08:36:59,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:59" (1/1) ... [2024-11-07 08:36:59,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:59" (1/1) ... [2024-11-07 08:36:59,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:59" (1/1) ... [2024-11-07 08:36:59,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:36:59,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:36:59,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:36:59,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:36:59,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:59" (1/1) ... [2024-11-07 08:36:59,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:36:59,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:36:59,343 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:36:59,345 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:36:59,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:36:59,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:36:59,360 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:36:59,360 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:36:59,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:36:59,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:36:59,414 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:36:59,416 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:36:59,660 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 08:36:59,661 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:36:59,668 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:36:59,669 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:36:59,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:36:59 BoogieIcfgContainer [2024-11-07 08:36:59,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:36:59,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:36:59,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:36:59,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:36:59,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:36:59" (1/3) ... [2024-11-07 08:36:59,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13cdcb53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:36:59, skipping insertion in model container [2024-11-07 08:36:59,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:59" (2/3) ... [2024-11-07 08:36:59,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13cdcb53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:36:59, skipping insertion in model container [2024-11-07 08:36:59,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:36:59" (3/3) ... [2024-11-07 08:36:59,679 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-88.i [2024-11-07 08:36:59,692 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:36:59,693 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:36:59,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:36:59,760 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;@3453f026, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:36:59,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:36:59,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 08:36:59,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 08:36:59,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:36:59,773 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:59,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:36:59,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:36:59,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2064427227, now seen corresponding path program 1 times [2024-11-07 08:36:59,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:36:59,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592019509] [2024-11-07 08:36:59,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:36:59,790 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:36:59,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:36:59,793 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:36:59,796 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:36:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:36:59,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:36:59,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:36:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-07 08:36:59,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:36:59,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:36:59,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592019509] [2024-11-07 08:36:59,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592019509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:36:59,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:36:59,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:36:59,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149920601] [2024-11-07 08:36:59,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:36:59,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:36:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:37:00,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:37:00,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:37:00,008 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 08:37:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:37:00,022 INFO L93 Difference]: Finished difference Result 75 states and 121 transitions. [2024-11-07 08:37:00,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:37:00,024 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 73 [2024-11-07 08:37:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:37:00,028 INFO L225 Difference]: With dead ends: 75 [2024-11-07 08:37:00,029 INFO L226 Difference]: Without dead ends: 37 [2024-11-07 08:37:00,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 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:37:00,035 INFO L432 NwaCegarLoop]: 50 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, 50 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:37:00,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:37:00,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-07 08:37:00,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-07 08:37:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 08:37:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-07 08:37:00,064 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 73 [2024-11-07 08:37:00,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:37:00,065 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-07 08:37:00,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 08:37:00,065 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-07 08:37:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 08:37:00,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:37:00,068 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:00,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 08:37:00,269 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:37:00,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:37:00,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:37:00,270 INFO L85 PathProgramCache]: Analyzing trace with hash -211911261, now seen corresponding path program 1 times [2024-11-07 08:37:00,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:37:00,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138869796] [2024-11-07 08:37:00,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:37:00,271 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:37:00,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:37:00,273 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:37:00,275 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:37:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:00,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 08:37:00,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:37:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-07 08:37:02,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:37:06,434 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 08:37:06,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:37:06,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138869796] [2024-11-07 08:37:06,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138869796] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 08:37:06,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:37:06,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-07 08:37:06,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18172658] [2024-11-07 08:37:06,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:37:06,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 08:37:06,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:37:06,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 08:37:06,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-07 08:37:06,437 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 08:37:08,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:37:08,155 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2024-11-07 08:37:08,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 08:37:08,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 73 [2024-11-07 08:37:08,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:37:08,159 INFO L225 Difference]: With dead ends: 90 [2024-11-07 08:37:08,159 INFO L226 Difference]: Without dead ends: 56 [2024-11-07 08:37:08,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2024-11-07 08:37:08,160 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 51 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:37:08,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 177 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 08:37:08,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-07 08:37:08,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-11-07 08:37:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 08:37:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2024-11-07 08:37:08,168 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 73 [2024-11-07 08:37:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:37:08,169 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2024-11-07 08:37:08,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 08:37:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2024-11-07 08:37:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 08:37:08,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:37:08,170 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:08,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 08:37:08,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:37:08,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:37:08,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:37:08,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1563096101, now seen corresponding path program 1 times [2024-11-07 08:37:08,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:37:08,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031157436] [2024-11-07 08:37:08,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:37:08,372 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:37:08,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:37:08,374 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:37:08,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 08:37:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:08,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 08:37:08,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:37:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 149 proven. 24 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-07 08:37:09,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:37:14,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:37:14,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031157436] [2024-11-07 08:37:14,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031157436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:37:14,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1369583825] [2024-11-07 08:37:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:37:14,297 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 08:37:14,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 08:37:14,301 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 08:37:14,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-07 08:37:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:14,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-07 08:37:14,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:37:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 158 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-07 08:37:19,136 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:37:25,805 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-07 08:37:25,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1369583825] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:37:25,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:37:25,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23, 11] total 42 [2024-11-07 08:37:25,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131652695] [2024-11-07 08:37:25,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:37:25,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-07 08:37:25,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:37:25,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-07 08:37:25,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1831, Unknown=0, NotChecked=0, Total=2162 [2024-11-07 08:37:25,808 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 42 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 40 states have internal predecessors, (82), 10 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2024-11-07 08:37:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:37:35,716 INFO L93 Difference]: Finished difference Result 181 states and 204 transitions. [2024-11-07 08:37:35,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-07 08:37:35,716 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 40 states have internal predecessors, (82), 10 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) Word has length 73 [2024-11-07 08:37:35,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:37:35,717 INFO L225 Difference]: With dead ends: 181 [2024-11-07 08:37:35,717 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 08:37:35,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3077 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=1951, Invalid=8761, Unknown=0, NotChecked=0, Total=10712 [2024-11-07 08:37:35,721 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 139 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 08:37:35,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 509 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 08:37:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 08:37:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 08:37:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 08:37:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 08:37:35,724 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2024-11-07 08:37:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:37:35,724 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 08:37:35,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 40 states have internal predecessors, (82), 10 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2024-11-07 08:37:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 08:37:35,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 08:37:35,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:37:35,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 08:37:35,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-07 08:37:36,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 08:37:36,131 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 08:37:36,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 08:37:45,423 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:37:45,434 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 08:37:45,434 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 08:37:45,434 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 08:37:45,434 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 08:37:45,434 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-07 08:37:45,435 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-07 08:37:45,435 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 08:37:45,436 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 08:37:45,436 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 08:37:45,449 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-07 08:37:45,449 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-07 08:37:45,449 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-07 08:37:45,449 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 08:37:45,449 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 08:37:45,449 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 08:37:45,449 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-07 08:37:45,449 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 08:37:45,449 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 08:37:45,449 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 08:37:45,449 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 08:37:45,449 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-07 08:37:45,449 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-07 08:37:45,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-07 08:37:45,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 08:37:45,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 08:37:45,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 08:37:45,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-07 08:37:45,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 08:37:45,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 08:37:45,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 08:37:45,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 08:37:45,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:37:45 BoogieIcfgContainer [2024-11-07 08:37:45,453 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:37:45,454 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:37:45,454 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:37:45,454 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:37:45,454 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:36:59" (3/4) ... [2024-11-07 08:37:45,456 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 08:37:45,459 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 08:37:45,463 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-07 08:37:45,463 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-07 08:37:45,463 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 08:37:45,463 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 08:37:45,514 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 08:37:45,515 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 08:37:45,515 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:37:45,515 INFO L158 Benchmark]: Toolchain (without parser) took 46470.12ms. Allocated memory was 83.9MB in the beginning and 234.9MB in the end (delta: 151.0MB). Free memory was 60.8MB in the beginning and 134.0MB in the end (delta: -73.2MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. [2024-11-07 08:37:45,516 INFO L158 Benchmark]: CDTParser took 2.49ms. Allocated memory is still 83.9MB. Free memory was 65.3MB in the beginning and 65.2MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:37:45,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.44ms. Allocated memory is still 83.9MB. Free memory was 60.5MB in the beginning and 48.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:37:45,516 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.70ms. Allocated memory is still 83.9MB. Free memory was 48.1MB in the beginning and 46.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:37:45,516 INFO L158 Benchmark]: Boogie Preprocessor took 28.22ms. Allocated memory is still 83.9MB. Free memory was 46.5MB in the beginning and 44.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:37:45,516 INFO L158 Benchmark]: RCFGBuilder took 350.97ms. Allocated memory is still 83.9MB. Free memory was 44.5MB in the beginning and 31.7MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:37:45,516 INFO L158 Benchmark]: TraceAbstraction took 45780.87ms. Allocated memory was 83.9MB in the beginning and 234.9MB in the end (delta: 151.0MB). Free memory was 31.1MB in the beginning and 137.5MB in the end (delta: -106.4MB). Peak memory consumption was 106.7MB. Max. memory is 16.1GB. [2024-11-07 08:37:45,516 INFO L158 Benchmark]: Witness Printer took 61.16ms. Allocated memory is still 234.9MB. Free memory was 137.5MB in the beginning and 134.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:37:45,520 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.49ms. Allocated memory is still 83.9MB. Free memory was 65.3MB in the beginning and 65.2MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.44ms. Allocated memory is still 83.9MB. Free memory was 60.5MB in the beginning and 48.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.70ms. Allocated memory is still 83.9MB. Free memory was 48.1MB in the beginning and 46.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.22ms. Allocated memory is still 83.9MB. Free memory was 46.5MB in the beginning and 44.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 350.97ms. Allocated memory is still 83.9MB. Free memory was 44.5MB in the beginning and 31.7MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 45780.87ms. Allocated memory was 83.9MB in the beginning and 234.9MB in the end (delta: 151.0MB). Free memory was 31.1MB in the beginning and 137.5MB in the end (delta: -106.4MB). Peak memory consumption was 106.7MB. Max. memory is 16.1GB. * Witness Printer took 61.16ms. Allocated memory is still 234.9MB. Free memory was 137.5MB in the beginning and 134.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.4s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 193 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 736 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 577 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 943 IncrementalHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 159 mSDtfsCounter, 943 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 517 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3133 ImplicationChecksByTransitivity, 19.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=2, InterpolantAutomatonStates: 70, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 23.3s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 432 ConstructedInterpolants, 0 QuantifiedInterpolants, 3507 SizeOfPredicates, 47 NumberOfNonLiveVariables, 502 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 1254/1320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((0 == var_1_11) && (var_1_12 <= 0)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((0 == var_1_11) || ((0 == var_1_11) && (var_1_12 <= 0))) || ((((((var_1_15 <= 1) && (0 == var_1_11)) && (var_1_14 >= 1)) && (var_1_14 <= 1)) && (var_1_12 <= 0)) && (var_1_15 >= 1))) Ensures: (((0 != cond) && (((0 == var_1_11) || ((0 == var_1_11) && (var_1_12 <= 0))) || ((((((var_1_15 <= 1) && (0 == var_1_11)) && (var_1_14 >= 1)) && (var_1_14 <= 1)) && (var_1_12 <= 0)) && (var_1_15 >= 1)))) && (((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (var_1_19 == \old(var_1_19))) && (var_1_20 == \old(var_1_20)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 08:37:45,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE