./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-19.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-19.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', '65f58f28fb2ab48eb34ed1db8ebd84c9e2d412cac48eab5e9d31a37142649836'] 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-19.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 65f58f28fb2ab48eb34ed1db8ebd84c9e2d412cac48eab5e9d31a37142649836 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:13:06,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:13:06,259 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:13:06,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:13:06,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:13:06,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:13:06,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:13:06,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:13:06,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:13:06,294 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:13:06,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:13:06,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:13:06,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:13:06,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:13:06,295 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:13:06,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:13:06,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:13:06,296 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:13:06,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:13:06,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:13:06,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:13:06,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:13:06,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:13:06,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:13:06,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:13:06,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:13:06,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:13:06,297 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:13:06,297 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:13:06,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:13:06,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:13:06,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:13:06,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:13:06,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:13:06,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:13:06,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:13:06,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:13:06,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:13:06,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:13:06,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:13:06,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:13:06,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:13:06,298 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 -> 65f58f28fb2ab48eb34ed1db8ebd84c9e2d412cac48eab5e9d31a37142649836 [2024-11-07 09:13:06,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:13:06,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:13:06,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:13:06,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:13:06,551 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:13:06,553 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-19.i [2024-11-07 09:13:07,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:13:07,987 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:13:07,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-19.i [2024-11-07 09:13:07,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1911d1cc5/b344f82e41514aaa9f976cb8ad14a72d/FLAG0efefbcdd [2024-11-07 09:13:08,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1911d1cc5/b344f82e41514aaa9f976cb8ad14a72d [2024-11-07 09:13:08,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:13:08,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:13:08,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:13:08,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:13:08,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:13:08,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:13:08" (1/1) ... [2024-11-07 09:13:08,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe54f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08, skipping insertion in model container [2024-11-07 09:13:08,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:13:08" (1/1) ... [2024-11-07 09:13:08,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:13:08,145 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-19.i[915,928] [2024-11-07 09:13:08,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:13:08,185 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:13:08,195 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-19.i[915,928] [2024-11-07 09:13:08,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:13:08,216 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:13:08,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08 WrapperNode [2024-11-07 09:13:08,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:13:08,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:13:08,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:13:08,219 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:13:08,223 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:13:08" (1/1) ... [2024-11-07 09:13:08,228 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:13:08" (1/1) ... [2024-11-07 09:13:08,246 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-11-07 09:13:08,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:13:08,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:13:08,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:13:08,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:13:08,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ... [2024-11-07 09:13:08,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ... [2024-11-07 09:13:08,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ... [2024-11-07 09:13:08,263 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:13:08,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ... [2024-11-07 09:13:08,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ... [2024-11-07 09:13:08,269 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ... [2024-11-07 09:13:08,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ... [2024-11-07 09:13:08,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ... [2024-11-07 09:13:08,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ... [2024-11-07 09:13:08,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:13:08,274 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:13:08,274 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:13:08,274 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:13:08,275 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (1/1) ... [2024-11-07 09:13:08,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:13:08,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:13:08,305 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:13:08,309 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:13:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:13:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:13:08,327 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:13:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:13:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:13:08,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:13:08,383 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:13:08,384 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:13:08,517 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 09:13:08,517 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:13:08,527 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:13:08,527 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:13:08,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:13:08 BoogieIcfgContainer [2024-11-07 09:13:08,527 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:13:08,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:13:08,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:13:08,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:13:08,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:13:08" (1/3) ... [2024-11-07 09:13:08,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae33a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:13:08, skipping insertion in model container [2024-11-07 09:13:08,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:08" (2/3) ... [2024-11-07 09:13:08,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae33a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:13:08, skipping insertion in model container [2024-11-07 09:13:08,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:13:08" (3/3) ... [2024-11-07 09:13:08,537 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-19.i [2024-11-07 09:13:08,547 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:13:08,548 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:13:08,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:13:08,600 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;@1ea4e423, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:13:08,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:13:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 09:13:08,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 09:13:08,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:13:08,615 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:13:08,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:13:08,620 INFO L85 PathProgramCache]: Analyzing trace with hash -2097998841, now seen corresponding path program 1 times [2024-11-07 09:13:08,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:13:08,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807992267] [2024-11-07 09:13:08,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:13:08,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:13:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:13:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:13:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:13:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:13:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:13:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:13:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:13:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:13:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:13:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:13:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:13:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:13:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:13:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:13:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:13:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:13:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:13:08,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:13:08,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807992267] [2024-11-07 09:13:08,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807992267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:13:08,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:13:08,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:13:08,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702968998] [2024-11-07 09:13:08,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:13:08,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:13:08,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:13:08,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:13:08,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:13:08,972 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 09:13:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:13:08,993 INFO L93 Difference]: Finished difference Result 83 states and 140 transitions. [2024-11-07 09:13:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:13:08,998 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 98 [2024-11-07 09:13:08,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:13:09,002 INFO L225 Difference]: With dead ends: 83 [2024-11-07 09:13:09,002 INFO L226 Difference]: Without dead ends: 41 [2024-11-07 09:13:09,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:13:09,008 INFO L432 NwaCegarLoop]: 58 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, 58 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:13:09,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:13:09,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-07 09:13:09,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-07 09:13:09,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 09:13:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2024-11-07 09:13:09,038 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 98 [2024-11-07 09:13:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:13:09,038 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-11-07 09:13:09,038 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 09:13:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2024-11-07 09:13:09,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 09:13:09,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:13:09,041 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:13:09,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:13:09,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:13:09,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1585843193, now seen corresponding path program 1 times [2024-11-07 09:13:09,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:13:09,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989855585] [2024-11-07 09:13:09,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:13:09,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:13:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:09,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:13:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:09,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:13:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:09,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:13:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:09,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:13:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:09,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:13:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:09,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:13:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:09,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:13:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:09,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:13:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:09,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:13:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:09,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:13:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:09,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:13:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:09,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:13:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:09,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:13:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:09,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:13:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:09,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:13:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:09,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:13:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:13:09,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:13:09,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989855585] [2024-11-07 09:13:09,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989855585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:13:09,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:13:09,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 09:13:09,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931979081] [2024-11-07 09:13:09,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:13:09,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 09:13:09,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:13:09,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 09:13:09,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:13:09,339 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:13:09,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:13:09,413 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2024-11-07 09:13:09,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 09:13:09,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2024-11-07 09:13:09,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:13:09,416 INFO L225 Difference]: With dead ends: 49 [2024-11-07 09:13:09,416 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 09:13:09,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:13:09,417 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 7 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:13:09,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 213 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:13:09,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 09:13:09,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2024-11-07 09:13:09,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 09:13:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2024-11-07 09:13:09,422 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 98 [2024-11-07 09:13:09,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:13:09,423 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2024-11-07 09:13:09,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:13:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2024-11-07 09:13:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 09:13:09,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:13:09,424 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:13:09,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:13:09,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:13:09,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2144755289, now seen corresponding path program 1 times [2024-11-07 09:13:09,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:13:09,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471225610] [2024-11-07 09:13:09,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:13:09,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:13:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:12,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:13:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:12,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:13:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:12,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:13:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:12,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:13:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:12,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:13:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:12,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:13:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:12,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:13:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:12,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:13:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:12,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:13:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:12,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:13:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:12,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:13:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:12,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:13:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:12,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:13:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:12,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:13:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:12,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 09:13:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:12,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 09:13:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:12,876 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:13:12,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:13:12,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471225610] [2024-11-07 09:13:12,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471225610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:13:12,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:13:12,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 09:13:12,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28981150] [2024-11-07 09:13:12,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:13:12,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 09:13:12,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:13:12,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 09:13:12,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 09:13:12,878 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:13:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:13:13,908 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2024-11-07 09:13:13,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 09:13:13,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-11-07 09:13:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:13:13,910 INFO L225 Difference]: With dead ends: 54 [2024-11-07 09:13:13,910 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 09:13:13,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-07 09:13:13,911 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 21 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:13:13,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 260 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:13:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 09:13:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 09:13:13,912 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:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 09:13:13,912 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2024-11-07 09:13:13,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:13:13,912 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 09:13:13,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:13:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 09:13:13,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 09:13:13,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:13:13,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 09:13:13,917 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 09:13:13,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 09:13:14,736 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:13:14,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:13:14 BoogieIcfgContainer [2024-11-07 09:13:14,772 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:13:14,772 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:13:14,772 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:13:14,772 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:13:14,773 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:13:08" (3/4) ... [2024-11-07 09:13:14,774 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 09:13:14,778 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 09:13:14,783 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-07 09:13:14,783 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 09:13:14,784 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 09:13:14,784 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 09:13:14,857 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 09:13:14,858 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 09:13:14,860 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:13:14,861 INFO L158 Benchmark]: Toolchain (without parser) took 6846.63ms. Allocated memory was 109.1MB in the beginning and 268.4MB in the end (delta: 159.4MB). Free memory was 85.6MB in the beginning and 189.5MB in the end (delta: -103.9MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2024-11-07 09:13:14,861 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:13:14,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.58ms. Allocated memory is still 109.1MB. Free memory was 85.4MB in the beginning and 73.7MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:13:14,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.14ms. Allocated memory is still 109.1MB. Free memory was 73.7MB in the beginning and 72.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:13:14,862 INFO L158 Benchmark]: Boogie Preprocessor took 26.06ms. Allocated memory is still 109.1MB. Free memory was 72.1MB in the beginning and 70.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:13:14,863 INFO L158 Benchmark]: RCFGBuilder took 253.31ms. Allocated memory is still 109.1MB. Free memory was 70.7MB in the beginning and 58.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:13:14,863 INFO L158 Benchmark]: TraceAbstraction took 6242.37ms. Allocated memory was 109.1MB in the beginning and 268.4MB in the end (delta: 159.4MB). Free memory was 57.6MB in the beginning and 194.8MB in the end (delta: -137.2MB). Peak memory consumption was 131.4MB. Max. memory is 16.1GB. [2024-11-07 09:13:14,863 INFO L158 Benchmark]: Witness Printer took 87.68ms. Allocated memory is still 268.4MB. Free memory was 194.8MB in the beginning and 189.5MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:13:14,864 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.55ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.58ms. Allocated memory is still 109.1MB. Free memory was 85.4MB in the beginning and 73.7MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.14ms. Allocated memory is still 109.1MB. Free memory was 73.7MB in the beginning and 72.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.06ms. Allocated memory is still 109.1MB. Free memory was 72.1MB in the beginning and 70.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 253.31ms. Allocated memory is still 109.1MB. Free memory was 70.7MB in the beginning and 58.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6242.37ms. Allocated memory was 109.1MB in the beginning and 268.4MB in the end (delta: 159.4MB). Free memory was 57.6MB in the beginning and 194.8MB in the end (delta: -137.2MB). Peak memory consumption was 131.4MB. Max. memory is 16.1GB. * Witness Printer took 87.68ms. Allocated memory is still 268.4MB. Free memory was 194.8MB in the beginning and 189.5MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. 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 - 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, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 531 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 355 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69 IncrementalHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 176 mSDtfsCounter, 69 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 797 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1440/1440 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: 77]: Loop Invariant Derived loop invariant: (((((3 + var_1_7) < var_1_8) || ((((var_1_3 / ((((((long long) var_1_4 + var_1_5) / 4294967296) * -4294967296) + var_1_4) + var_1_5)) < (((((var_1_3 / ((((((long long) var_1_4 + var_1_5) / 4294967296) * -4294967296) + var_1_4) + var_1_5)) >= 0) ? ((var_1_3 / ((((((long long) var_1_4 + var_1_5) / 4294967296) * -4294967296) + var_1_4) + var_1_5)) / 4294967296) : (((var_1_3 / ((((((long long) var_1_4 + var_1_5) / 4294967296) * -4294967296) + var_1_4) + var_1_5)) / 4294967296) - 1)) * 4294967296) + var_1_6)) || (var_1_1 == var_1_9)) && (((((((var_1_3 / ((((((long long) var_1_4 + var_1_5) / 4294967296) * -4294967296) + var_1_4) + var_1_5)) >= 0) ? ((var_1_3 / ((((((long long) var_1_4 + var_1_5) / 4294967296) * -4294967296) + var_1_4) + var_1_5)) / 4294967296) : (((var_1_3 / ((((((long long) var_1_4 + var_1_5) / 4294967296) * -4294967296) + var_1_4) + var_1_5)) / 4294967296) - 1)) * 4294967296) + var_1_6) < ((var_1_3 / ((((((long long) var_1_4 + var_1_5) / 4294967296) * -4294967296) + var_1_4) + var_1_5)) + 1)) || ((((((65536 + var_1_1) == ((65532 + var_1_9) % 65536)) || (((65532 + var_1_9) % 65536) < 32768)) && ((32767 < ((65532 + var_1_9) % 65536)) || (((65532 + var_1_9) % 65536) == var_1_1))) || (var_1_9 < (var_1_7 + 4))) && (((3 + var_1_7) < var_1_9) || (((((var_1_7 >= 0) ? (var_1_7 % 65536) : ((var_1_7 % 65536) + 65536)) == (65536 + var_1_1)) || (((var_1_7 >= 0) ? (var_1_7 % 65536) : ((var_1_7 % 65536) + 65536)) < 32768)) && ((32767 < ((var_1_7 >= 0) ? (var_1_7 % 65536) : ((var_1_7 % 65536) + 65536))) || (((var_1_7 >= 0) ? (var_1_7 % 65536) : ((var_1_7 % 65536) + 65536)) == var_1_1)))))))) && (((((var_1_3 / ((((((long long) var_1_4 + var_1_5) / 4294967296) * -4294967296) + var_1_4) + var_1_5)) < (((((var_1_3 / ((((((long long) var_1_4 + var_1_5) / 4294967296) * -4294967296) + var_1_4) + var_1_5)) >= 0) ? ((var_1_3 / ((((((long long) var_1_4 + var_1_5) / 4294967296) * -4294967296) + var_1_4) + var_1_5)) / 4294967296) : (((var_1_3 / ((((((long long) var_1_4 + var_1_5) / 4294967296) * -4294967296) + var_1_4) + var_1_5)) / 4294967296) - 1)) * 4294967296) + var_1_6)) || (var_1_1 == var_1_9)) && ((((32767 < ((65532 + var_1_8) % 65536)) || (((((((65532 + var_1_8) % 65536) == var_1_1) || (var_1_8 < (var_1_9 + 1))) && ((var_1_9 < var_1_8) || (((65532 + var_1_9) % 65536) == var_1_1))) || (32767 < ((65532 + var_1_9) % 65536))) && ((((((65532 + var_1_8) % 65536) == var_1_1) || (var_1_8 < (var_1_9 + 1))) && ((var_1_9 < var_1_8) || ((65536 + var_1_1) == ((65532 + var_1_9) % 65536)))) || (((65532 + var_1_9) % 65536) < 32768)))) && ((((32767 < ((65532 + var_1_9) % 65536)) || (((var_1_9 < var_1_8) || (((65532 + var_1_9) % 65536) == var_1_1)) && ((var_1_8 < (var_1_9 + 1)) || ((65536 + var_1_1) == ((65532 + var_1_8) % 65536))))) && ((((65532 + var_1_9) % 65536) < 32768) || (((var_1_8 < (var_1_9 + 1)) || ((65536 + var_1_1) == ((65532 + var_1_8) % 65536))) && ((var_1_9 < var_1_8) || ((65536 + var_1_1) == ((65532 + var_1_9) % 65536)))))) || (((65532 + var_1_8) % 65536) < 32768))) || ((((((var_1_3 / ((((((long long) var_1_4 + var_1_5) / 4294967296) * -4294967296) + var_1_4) + var_1_5)) >= 0) ? ((var_1_3 / ((((((long long) var_1_4 + var_1_5) / 4294967296) * -4294967296) + var_1_4) + var_1_5)) / 4294967296) : (((var_1_3 / ((((((long long) var_1_4 + var_1_5) / 4294967296) * -4294967296) + var_1_4) + var_1_5)) / 4294967296) - 1)) * 4294967296) + var_1_6) < ((var_1_3 / ((((((long long) var_1_4 + var_1_5) / 4294967296) * -4294967296) + var_1_4) + var_1_5)) + 1)))) || (var_1_8 < (var_1_7 + 4)))) || (var_1_2 == 0)) - 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_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) RESULT: Ultimate proved your program to be correct! [2024-11-07 09:13:14,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE