./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.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', '148999594253053f645653c1095151edf31299f622d6000962ab26f32e38bd4b'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.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 148999594253053f645653c1095151edf31299f622d6000962ab26f32e38bd4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:12:46,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:12:46,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 09:12:46,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:12:46,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:12:46,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:12:46,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:12:46,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:12:46,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:12:46,856 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:12:46,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:12:46,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:12:46,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:12:46,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:12:46,857 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:12:46,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:12:46,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:12:46,859 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:12:46,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:12:46,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:12:46,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:12:46,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:12:46,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:12:46,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:12:46,860 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:12:46,860 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:12:46,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:12:46,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:12:46,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:12:46,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:12:46,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:12:46,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:12:46,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:12:46,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:12:46,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:12:46,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:12:46,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:12:46,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:12:46,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:12:46,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:12:46,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:12:46,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:12:46,861 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 -> 148999594253053f645653c1095151edf31299f622d6000962ab26f32e38bd4b [2024-11-07 09:12:47,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:12:47,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:12:47,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:12:47,154 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:12:47,155 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:12:47,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i [2024-11-07 09:12:48,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:12:48,755 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:12:48,757 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i [2024-11-07 09:12:48,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6485527c1/fbea6e0f8c634696ad7a27b9fb9b24a1/FLAG063565ef7 [2024-11-07 09:12:48,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6485527c1/fbea6e0f8c634696ad7a27b9fb9b24a1 [2024-11-07 09:12:48,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:12:48,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:12:48,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:12:48,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:12:48,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:12:48,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:12:48" (1/1) ... [2024-11-07 09:12:48,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36fb610a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:48, skipping insertion in model container [2024-11-07 09:12:48,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:12:48" (1/1) ... [2024-11-07 09:12:48,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:12:48,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i[915,928] [2024-11-07 09:12:48,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:12:48,997 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:12:49,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i[915,928] [2024-11-07 09:12:49,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:12:49,039 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:12:49,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:49 WrapperNode [2024-11-07 09:12:49,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:12:49,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:12:49,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:12:49,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:12:49,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:49" (1/1) ... [2024-11-07 09:12:49,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:49" (1/1) ... [2024-11-07 09:12:49,075 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 68 [2024-11-07 09:12:49,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:12:49,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:12:49,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:12:49,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:12:49,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:49" (1/1) ... [2024-11-07 09:12:49,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:49" (1/1) ... [2024-11-07 09:12:49,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:49" (1/1) ... [2024-11-07 09:12:49,104 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 09:12:49,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:49" (1/1) ... [2024-11-07 09:12:49,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:49" (1/1) ... [2024-11-07 09:12:49,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:49" (1/1) ... [2024-11-07 09:12:49,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:49" (1/1) ... [2024-11-07 09:12:49,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:49" (1/1) ... [2024-11-07 09:12:49,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:49" (1/1) ... [2024-11-07 09:12:49,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:12:49,125 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:12:49,125 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:12:49,125 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:12:49,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:49" (1/1) ... [2024-11-07 09:12:49,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:12:49,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:12:49,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 09:12:49,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 09:12:49,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:12:49,191 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:12:49,191 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:12:49,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:12:49,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:12:49,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:12:49,261 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:12:49,264 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:12:49,408 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 09:12:49,408 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:12:49,418 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:12:49,418 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:12:49,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:12:49 BoogieIcfgContainer [2024-11-07 09:12:49,419 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:12:49,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:12:49,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:12:49,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:12:49,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:12:48" (1/3) ... [2024-11-07 09:12:49,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555537e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:12:49, skipping insertion in model container [2024-11-07 09:12:49,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:49" (2/3) ... [2024-11-07 09:12:49,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555537e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:12:49, skipping insertion in model container [2024-11-07 09:12:49,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:12:49" (3/3) ... [2024-11-07 09:12:49,428 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-12.i [2024-11-07 09:12:49,441 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:12:49,441 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:12:49,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:12:49,512 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;@50f199d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:12:49,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:12:49,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 09:12:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 09:12:49,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:12:49,526 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:12:49,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:12:49,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:12:49,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1159997385, now seen corresponding path program 1 times [2024-11-07 09:12:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:12:49,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021683422] [2024-11-07 09:12:49,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:12:49,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:12:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:12:49,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:12:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:12:49,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:12:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:12:49,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:12:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:12:49,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:12:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:12:49,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:12:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:12:49,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:12:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:12:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 09:12:49,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:12:49,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021683422] [2024-11-07 09:12:49,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021683422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:12:49,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:12:49,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:12:49,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269660937] [2024-11-07 09:12:49,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:12:49,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:12:49,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:12:49,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:12:49,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:12:49,825 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 09:12:49,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:12:49,841 INFO L93 Difference]: Finished difference Result 53 states and 78 transitions. [2024-11-07 09:12:49,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:12:49,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-11-07 09:12:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:12:49,851 INFO L225 Difference]: With dead ends: 53 [2024-11-07 09:12:49,851 INFO L226 Difference]: Without dead ends: 26 [2024-11-07 09:12:49,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:12:49,857 INFO L432 NwaCegarLoop]: 32 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, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:12:49,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:12:49,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-07 09:12:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-07 09:12:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 09:12:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-07 09:12:49,890 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 44 [2024-11-07 09:12:49,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:12:49,892 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-07 09:12:49,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 09:12:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-07 09:12:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 09:12:49,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:12:49,895 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:12:49,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:12:49,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:12:49,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:12:49,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1413855497, now seen corresponding path program 1 times [2024-11-07 09:12:49,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:12:49,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140593865] [2024-11-07 09:12:49,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:12:49,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:12:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:12:49,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 09:12:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:12:50,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 09:12:50,055 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 09:12:50,056 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:12:50,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:12:50,061 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-07 09:12:50,098 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:12:50,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:12:50 BoogieIcfgContainer [2024-11-07 09:12:50,104 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:12:50,105 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:12:50,105 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:12:50,105 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:12:50,106 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:12:49" (3/4) ... [2024-11-07 09:12:50,108 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 09:12:50,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:12:50,110 INFO L158 Benchmark]: Toolchain (without parser) took 1319.18ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 54.6MB in the end (delta: 21.8MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2024-11-07 09:12:50,111 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:12:50,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.27ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 64.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:12:50,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.11ms. Allocated memory is still 100.7MB. Free memory was 64.6MB in the beginning and 63.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:12:50,114 INFO L158 Benchmark]: Boogie Preprocessor took 47.70ms. Allocated memory is still 100.7MB. Free memory was 63.2MB in the beginning and 61.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:12:50,114 INFO L158 Benchmark]: RCFGBuilder took 293.99ms. Allocated memory is still 100.7MB. Free memory was 61.5MB in the beginning and 50.7MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:12:50,115 INFO L158 Benchmark]: TraceAbstraction took 683.25ms. Allocated memory is still 100.7MB. Free memory was 50.0MB in the beginning and 55.1MB in the end (delta: -5.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:12:50,115 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 100.7MB. Free memory was 54.6MB in the beginning and 54.6MB in the end (delta: 18.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:12:50,119 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.98ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.27ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 64.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.11ms. Allocated memory is still 100.7MB. Free memory was 64.6MB in the beginning and 63.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.70ms. Allocated memory is still 100.7MB. Free memory was 63.2MB in the beginning and 61.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 293.99ms. Allocated memory is still 100.7MB. Free memory was 61.5MB in the beginning and 50.7MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 683.25ms. Allocated memory is still 100.7MB. Free memory was 50.0MB in the beginning and 55.1MB in the end (delta: -5.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 100.7MB. Free memory was 54.6MB in the beginning and 54.6MB in the end (delta: 18.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 4; [L23] signed char var_1_4 = -1; [L24] signed char var_1_5 = 100; [L25] signed long int var_1_6 = 1000; [L26] double var_1_7 = 4.5; [L27] unsigned char var_1_8 = 1; [L28] unsigned char var_1_9 = 0; [L29] signed long int var_1_10 = 256; [L30] signed char last_1_var_1_1 = 4; VAL [isInitial=0, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=-1, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L62] isInitial = 1 [L63] FCALL initially() [L64] COND TRUE 1 [L65] CALL updateLastVariables() [L55] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=-1, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L65] RET updateLastVariables() [L66] CALL updateVariables() [L44] var_1_4 = __VERIFIER_nondet_char() [L45] CALL assume_abort_if_not(var_1_4 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L45] RET assume_abort_if_not(var_1_4 >= -126) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L46] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L46] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L47] var_1_5 = __VERIFIER_nondet_char() [L48] CALL assume_abort_if_not(var_1_5 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L48] RET assume_abort_if_not(var_1_5 >= -126) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L49] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L49] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L50] var_1_9 = __VERIFIER_nondet_uchar() [L51] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1] [L51] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1] [L52] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L52] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L66] RET updateVariables() [L67] CALL step() [L34] var_1_7 = 199.5 [L35] var_1_8 = var_1_9 [L36] var_1_10 = var_1_5 [L37] signed long int stepLocal_0 = var_1_10; VAL [isInitial=1, last_1_var_1_1=4, stepLocal_0=4, var_1_10=4, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=399/2, var_1_8=0, var_1_9=0] [L38] COND TRUE stepLocal_0 >= last_1_var_1_1 [L39] var_1_1 = (((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) < 0 ) ? -((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) : ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=4, var_1_1=0, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=399/2, var_1_8=0, var_1_9=0] [L41] var_1_6 = ((((var_1_4) > (var_1_1)) ? (var_1_4) : (var_1_1))) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=4, var_1_1=0, var_1_4=0, var_1_5=4, var_1_6=0, var_1_7=399/2, var_1_8=0, var_1_9=0] [L67] RET step() [L68] CALL, EXPR property() [L58-L59] return (((((var_1_10 >= last_1_var_1_1) ? (var_1_1 == ((signed char) (((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) < 0 ) ? -((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) : ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) : 1) && (var_1_6 == ((signed long int) ((((var_1_4) > (var_1_1)) ? (var_1_4) : (var_1_1)))))) && (var_1_7 == ((double) 199.5))) && (var_1_8 == ((unsigned char) var_1_9))) && (var_1_10 == ((signed long int) var_1_5)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=4, var_1_10=4, var_1_1=0, var_1_4=0, var_1_5=4, var_1_6=0, var_1_7=399/2, var_1_8=0, var_1_9=0] [L68] RET, EXPR property() [L68] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=4, var_1_1=0, var_1_4=0, var_1_5=4, var_1_6=0, var_1_7=399/2, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=4, var_1_10=4, var_1_1=0, var_1_4=0, var_1_5=4, var_1_6=0, var_1_7=399/2, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 32 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, 32 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 43 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 60/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 09:12:50,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.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 148999594253053f645653c1095151edf31299f622d6000962ab26f32e38bd4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:12:52,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:12:52,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 09:12:52,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:12:52,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:12:52,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:12:52,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:12:52,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:12:52,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:12:52,501 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:12:52,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:12:52,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:12:52,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:12:52,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:12:52,502 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:12:52,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:12:52,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:12:52,502 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:12:52,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:12:52,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:12:52,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:12:52,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:12:52,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:12:52,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 09:12:52,503 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 09:12:52,505 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:12:52,505 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 09:12:52,505 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:12:52,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:12:52,506 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:12:52,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:12:52,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:12:52,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:12:52,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:12:52,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:12:52,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:12:52,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:12:52,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:12:52,506 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 09:12:52,506 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 09:12:52,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:12:52,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:12:52,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:12:52,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:12:52,507 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 -> 148999594253053f645653c1095151edf31299f622d6000962ab26f32e38bd4b [2024-11-07 09:12:52,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:12:52,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:12:52,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:12:52,810 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:12:52,812 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:12:52,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i [2024-11-07 09:12:54,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:12:54,504 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:12:54,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i [2024-11-07 09:12:54,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/308389da9/9593e8fdd8824e649f4deb04fdba15ea/FLAG51609af84 [2024-11-07 09:12:54,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/308389da9/9593e8fdd8824e649f4deb04fdba15ea [2024-11-07 09:12:54,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:12:54,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:12:54,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:12:54,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:12:54,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:12:54,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:12:54" (1/1) ... [2024-11-07 09:12:54,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55742c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:54, skipping insertion in model container [2024-11-07 09:12:54,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:12:54" (1/1) ... [2024-11-07 09:12:54,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:12:55,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i[915,928] [2024-11-07 09:12:55,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:12:55,061 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:12:55,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i[915,928] [2024-11-07 09:12:55,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:12:55,111 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:12:55,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:55 WrapperNode [2024-11-07 09:12:55,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:12:55,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:12:55,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:12:55,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:12:55,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:55" (1/1) ... [2024-11-07 09:12:55,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:55" (1/1) ... [2024-11-07 09:12:55,155 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 66 [2024-11-07 09:12:55,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:12:55,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:12:55,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:12:55,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:12:55,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:55" (1/1) ... [2024-11-07 09:12:55,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:55" (1/1) ... [2024-11-07 09:12:55,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:55" (1/1) ... [2024-11-07 09:12:55,182 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 09:12:55,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:55" (1/1) ... [2024-11-07 09:12:55,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:55" (1/1) ... [2024-11-07 09:12:55,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:55" (1/1) ... [2024-11-07 09:12:55,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:55" (1/1) ... [2024-11-07 09:12:55,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:55" (1/1) ... [2024-11-07 09:12:55,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:55" (1/1) ... [2024-11-07 09:12:55,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:12:55,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:12:55,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:12:55,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:12:55,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:55" (1/1) ... [2024-11-07 09:12:55,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:12:55,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:12:55,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 09:12:55,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 09:12:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:12:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 09:12:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:12:55,274 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:12:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:12:55,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:12:55,359 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:12:55,361 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:12:55,557 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 09:12:55,557 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:12:55,570 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:12:55,571 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:12:55,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:12:55 BoogieIcfgContainer [2024-11-07 09:12:55,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:12:55,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:12:55,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:12:55,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:12:55,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:12:54" (1/3) ... [2024-11-07 09:12:55,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720fc1a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:12:55, skipping insertion in model container [2024-11-07 09:12:55,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:12:55" (2/3) ... [2024-11-07 09:12:55,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720fc1a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:12:55, skipping insertion in model container [2024-11-07 09:12:55,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:12:55" (3/3) ... [2024-11-07 09:12:55,583 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-12.i [2024-11-07 09:12:55,597 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:12:55,597 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:12:55,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:12:55,672 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;@b951d8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:12:55,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:12:55,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 09:12:55,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 09:12:55,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:12:55,686 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:12:55,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:12:55,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:12:55,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1159997385, now seen corresponding path program 1 times [2024-11-07 09:12:55,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:12:55,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899652975] [2024-11-07 09:12:55,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:12:55,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 09:12:55,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:12:55,705 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 09:12:55,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 09:12:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:12:55,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 09:12:55,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:12:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-07 09:12:55,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:12:55,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:12:55,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899652975] [2024-11-07 09:12:55,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899652975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:12:55,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:12:55,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:12:55,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314519998] [2024-11-07 09:12:55,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:12:55,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:12:55,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:12:55,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:12:55,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:12:55,893 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 09:12:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:12:55,915 INFO L93 Difference]: Finished difference Result 53 states and 78 transitions. [2024-11-07 09:12:55,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:12:55,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-11-07 09:12:55,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:12:55,922 INFO L225 Difference]: With dead ends: 53 [2024-11-07 09:12:55,923 INFO L226 Difference]: Without dead ends: 26 [2024-11-07 09:12:55,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:12:55,932 INFO L432 NwaCegarLoop]: 32 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, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:12:55,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:12:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-07 09:12:55,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-07 09:12:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 09:12:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-07 09:12:55,972 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 44 [2024-11-07 09:12:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:12:55,973 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-07 09:12:55,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 09:12:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-07 09:12:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 09:12:55,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:12:55,976 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:12:55,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 09:12:56,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 09:12:56,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:12:56,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:12:56,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1413855497, now seen corresponding path program 1 times [2024-11-07 09:12:56,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:12:56,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129578712] [2024-11-07 09:12:56,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:12:56,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 09:12:56,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:12:56,186 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 09:12:56,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 09:12:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:12:56,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 09:12:56,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:13:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 09:13:02,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:13:02,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:13:02,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129578712] [2024-11-07 09:13:02,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129578712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:13:02,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:13:02,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 09:13:02,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363296980] [2024-11-07 09:13:02,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:13:02,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 09:13:02,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:13:02,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 09:13:02,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:13:02,394 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 09:13:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:13:02,767 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-11-07 09:13:02,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 09:13:02,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2024-11-07 09:13:02,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:13:02,769 INFO L225 Difference]: With dead ends: 44 [2024-11-07 09:13:02,769 INFO L226 Difference]: Without dead ends: 42 [2024-11-07 09:13:02,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:13:02,771 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 23 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:13:02,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 161 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:13:02,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-07 09:13:02,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-07 09:13:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 09:13:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-11-07 09:13:02,783 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 44 [2024-11-07 09:13:02,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:13:02,784 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-07 09:13:02,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 09:13:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-11-07 09:13:02,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 09:13:02,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:13:02,785 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:13:02,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 09:13:02,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 09:13:02,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:13:02,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:13:02,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1356597195, now seen corresponding path program 1 times [2024-11-07 09:13:02,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:13:02,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125391955] [2024-11-07 09:13:02,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:13:02,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 09:13:02,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:13:02,992 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 09:13:02,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 09:13:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:03,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 09:13:03,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:13:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 09:13:08,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:13:08,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:13:08,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125391955] [2024-11-07 09:13:08,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125391955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:13:08,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:13:08,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 09:13:08,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048291938] [2024-11-07 09:13:08,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:13:08,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 09:13:08,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:13:08,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 09:13:08,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:13:08,017 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 09:13:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:13:08,388 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2024-11-07 09:13:08,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 09:13:08,390 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2024-11-07 09:13:08,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:13:08,391 INFO L225 Difference]: With dead ends: 66 [2024-11-07 09:13:08,391 INFO L226 Difference]: Without dead ends: 64 [2024-11-07 09:13:08,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-07 09:13:08,393 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:13:08,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 194 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:13:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-07 09:13:08,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-11-07 09:13:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 45 states have internal predecessors, (47), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 09:13:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2024-11-07 09:13:08,410 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 44 [2024-11-07 09:13:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:13:08,411 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2024-11-07 09:13:08,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 09:13:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2024-11-07 09:13:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 09:13:08,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:13:08,415 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:13:08,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 09:13:08,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 09:13:08,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:13:08,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:13:08,617 INFO L85 PathProgramCache]: Analyzing trace with hash -272324834, now seen corresponding path program 1 times [2024-11-07 09:13:08,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:13:08,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421356639] [2024-11-07 09:13:08,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:13:08,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 09:13:08,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:13:08,623 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 09:13:08,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 09:13:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 09:13:08,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:13:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-11-07 09:13:10,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:13:10,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:13:10,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421356639] [2024-11-07 09:13:10,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421356639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:13:10,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:13:10,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 09:13:10,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554978065] [2024-11-07 09:13:10,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:13:10,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 09:13:10,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:13:10,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 09:13:10,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:13:10,715 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 09:13:10,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:13:10,923 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2024-11-07 09:13:10,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 09:13:10,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 85 [2024-11-07 09:13:10,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:13:10,927 INFO L225 Difference]: With dead ends: 65 [2024-11-07 09:13:10,927 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 09:13:10,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:13:10,928 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:13:10,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:13:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 09:13:10,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 09:13:10,929 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 09:13:10,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 09:13:10,931 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2024-11-07 09:13:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:13:10,932 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 09:13:10,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 09:13:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 09:13:10,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 09:13:10,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:13:10,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 09:13:11,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 09:13:11,143 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 09:13:11,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 09:13:11,391 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:13:11,400 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:13:11,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:13:11 BoogieIcfgContainer [2024-11-07 09:13:11,410 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:13:11,411 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:13:11,411 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:13:11,412 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:13:11,412 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:12:55" (3/4) ... [2024-11-07 09:13:11,414 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 09:13:11,420 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 09:13:11,425 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-07 09:13:11,425 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-07 09:13:11,425 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 09:13:11,425 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 09:13:11,504 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 09:13:11,504 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 09:13:11,505 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:13:11,506 INFO L158 Benchmark]: Toolchain (without parser) took 16647.22ms. Allocated memory was 83.9MB in the beginning and 570.4MB in the end (delta: 486.5MB). Free memory was 61.1MB in the beginning and 269.6MB in the end (delta: -208.5MB). Peak memory consumption was 272.9MB. Max. memory is 16.1GB. [2024-11-07 09:13:11,509 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 83.9MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:13:11,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.72ms. Allocated memory is still 83.9MB. Free memory was 60.8MB in the beginning and 48.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:13:11,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.49ms. Allocated memory is still 83.9MB. Free memory was 48.7MB in the beginning and 47.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:13:11,509 INFO L158 Benchmark]: Boogie Preprocessor took 54.57ms. Allocated memory is still 83.9MB. Free memory was 47.3MB in the beginning and 45.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:13:11,510 INFO L158 Benchmark]: RCFGBuilder took 359.85ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 34.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:13:11,510 INFO L158 Benchmark]: TraceAbstraction took 15835.83ms. Allocated memory was 83.9MB in the beginning and 570.4MB in the end (delta: 486.5MB). Free memory was 33.7MB in the beginning and 273.6MB in the end (delta: -240.0MB). Peak memory consumption was 247.8MB. Max. memory is 16.1GB. [2024-11-07 09:13:11,510 INFO L158 Benchmark]: Witness Printer took 94.08ms. Allocated memory is still 570.4MB. Free memory was 273.6MB in the beginning and 269.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:13:11,513 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.53ms. Allocated memory is still 83.9MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.72ms. Allocated memory is still 83.9MB. Free memory was 60.8MB in the beginning and 48.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.49ms. Allocated memory is still 83.9MB. Free memory was 48.7MB in the beginning and 47.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.57ms. Allocated memory is still 83.9MB. Free memory was 47.3MB in the beginning and 45.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 359.85ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 34.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15835.83ms. Allocated memory was 83.9MB in the beginning and 570.4MB in the end (delta: 486.5MB). Free memory was 33.7MB in the beginning and 273.6MB in the end (delta: -240.0MB). Peak memory consumption was 247.8MB. Max. memory is 16.1GB. * Witness Printer took 94.08ms. Allocated memory is still 570.4MB. Free memory was 273.6MB in the beginning and 269.6MB in the end (delta: 4.0MB). 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 * 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.5s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 524 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 387 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 251 IncrementalHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 137 mSDtfsCounter, 251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 773 SizeOfPredicates, 30 NumberOfNonLiveVariables, 393 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 460/460 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: 64]: Loop Invariant Derived loop invariant: (((var_1_1 == 4) && (4 == last_1_var_1_1)) || ((var_1_5 == var_1_10) && (var_1_8 == var_1_9))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (last_1_var_1_1 == \old(last_1_var_1_1))) RESULT: Ultimate proved your program to be correct! [2024-11-07 09:13:11,542 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