./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.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', '192fd2fa21417aa09ed325872128b5046e8cfebc6357a29362e62278761c25b9'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.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 192fd2fa21417aa09ed325872128b5046e8cfebc6357a29362e62278761c25b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:24:23,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:24:23,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:24:23,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:24:23,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:24:23,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:24:23,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:24:23,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:24:23,208 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:24:23,208 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:24:23,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:24:23,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:24:23,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:24:23,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:24:23,209 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:24:23,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:24:23,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:24:23,209 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:24:23,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:24:23,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:24:23,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:24:23,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:24:23,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:24:23,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:24:23,210 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:24:23,210 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:24:23,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:24:23,211 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:24:23,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:24:23,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:24:23,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:24:23,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:24:23,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:24:23,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:24:23,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:24:23,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:24:23,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:24:23,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:24:23,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:24:23,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:24:23,212 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:24:23,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:24:23,212 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 -> 192fd2fa21417aa09ed325872128b5046e8cfebc6357a29362e62278761c25b9 [2024-11-07 08:24:23,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:24:23,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:24:23,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:24:23,498 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:24:23,498 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:24:23,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i [2024-11-07 08:24:24,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:24:25,070 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:24:25,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i [2024-11-07 08:24:25,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b91070bc4/02735f8ea3dc44c2b2bc5edcd00ad509/FLAG7bf48915c [2024-11-07 08:24:25,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b91070bc4/02735f8ea3dc44c2b2bc5edcd00ad509 [2024-11-07 08:24:25,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:24:25,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:24:25,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:24:25,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:24:25,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:24:25,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:24:25" (1/1) ... [2024-11-07 08:24:25,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb6ea04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:25, skipping insertion in model container [2024-11-07 08:24:25,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:24:25" (1/1) ... [2024-11-07 08:24:25,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:24:25,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i[915,928] [2024-11-07 08:24:25,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:24:25,338 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:24:25,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i[915,928] [2024-11-07 08:24:25,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:24:25,392 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:24:25,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:25 WrapperNode [2024-11-07 08:24:25,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:24:25,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:24:25,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:24:25,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:24:25,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:25" (1/1) ... [2024-11-07 08:24:25,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:25" (1/1) ... [2024-11-07 08:24:25,446 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-11-07 08:24:25,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:24:25,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:24:25,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:24:25,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:24:25,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:25" (1/1) ... [2024-11-07 08:24:25,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:25" (1/1) ... [2024-11-07 08:24:25,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:25" (1/1) ... [2024-11-07 08:24:25,491 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:24:25,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:25" (1/1) ... [2024-11-07 08:24:25,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:25" (1/1) ... [2024-11-07 08:24:25,497 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:25" (1/1) ... [2024-11-07 08:24:25,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:25" (1/1) ... [2024-11-07 08:24:25,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:25" (1/1) ... [2024-11-07 08:24:25,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:25" (1/1) ... [2024-11-07 08:24:25,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:24:25,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:24:25,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:24:25,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:24:25,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:25" (1/1) ... [2024-11-07 08:24:25,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:24:25,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:24:25,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:24:25,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:24:25,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:24:25,592 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:24:25,592 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:24:25,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:24:25,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:24:25,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:24:25,680 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:24:25,682 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:24:25,946 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-07 08:24:25,946 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:24:25,959 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:24:25,960 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:24:25,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:24:25 BoogieIcfgContainer [2024-11-07 08:24:25,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:24:25,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:24:25,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:24:25,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:24:25,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:24:25" (1/3) ... [2024-11-07 08:24:25,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368e6e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:24:25, skipping insertion in model container [2024-11-07 08:24:25,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:25" (2/3) ... [2024-11-07 08:24:25,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368e6e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:24:25, skipping insertion in model container [2024-11-07 08:24:25,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:24:25" (3/3) ... [2024-11-07 08:24:25,968 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-74.i [2024-11-07 08:24:25,982 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:24:25,982 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:24:26,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:24:26,062 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;@1581cd86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:24:26,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:24:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 08:24:26,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 08:24:26,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:24:26,082 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:24:26,083 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:24:26,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:24:26,089 INFO L85 PathProgramCache]: Analyzing trace with hash 571409010, now seen corresponding path program 1 times [2024-11-07 08:24:26,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:24:26,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533714908] [2024-11-07 08:24:26,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:24:26,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:24:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:24:26,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:24:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:24:26,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 08:24:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:24:26,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 08:24:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:24:26,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 08:24:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:24:26,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 08:24:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:24:26,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 08:24:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:24:26,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 08:24:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:24:26,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 08:24:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:24:26,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 08:24:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:24:26,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:24:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:24:26,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 08:24:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:24:26,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 08:24:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:24:26,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 08:24:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:24:26,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 08:24:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:24:26,464 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 08:24:26,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:24:26,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533714908] [2024-11-07 08:24:26,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533714908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:24:26,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:24:26,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:24:26,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945130286] [2024-11-07 08:24:26,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:24:26,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:24:26,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:24:26,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:24:26,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:24:26,496 INFO L87 Difference]: Start difference. First operand has 52 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 08:24:26,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:24:26,523 INFO L93 Difference]: Finished difference Result 101 states and 159 transitions. [2024-11-07 08:24:26,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:24:26,525 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2024-11-07 08:24:26,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:24:26,532 INFO L225 Difference]: With dead ends: 101 [2024-11-07 08:24:26,533 INFO L226 Difference]: Without dead ends: 48 [2024-11-07 08:24:26,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:24:26,539 INFO L432 NwaCegarLoop]: 71 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, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:24:26,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:24:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-07 08:24:26,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-07 08:24:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 08:24:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2024-11-07 08:24:26,584 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 95 [2024-11-07 08:24:26,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:24:26,585 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2024-11-07 08:24:26,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 08:24:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2024-11-07 08:24:26,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 08:24:26,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:24:26,588 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:24:26,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:24:26,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:24:26,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:24:26,589 INFO L85 PathProgramCache]: Analyzing trace with hash -588451738, now seen corresponding path program 1 times [2024-11-07 08:24:26,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:24:26,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308462549] [2024-11-07 08:24:26,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:24:26,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:24:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:24:26,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:24:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:24:26,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:24:26,944 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:24:26,946 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:24:26,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:24:26,951 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-07 08:24:27,039 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:24:27,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:24:27 BoogieIcfgContainer [2024-11-07 08:24:27,042 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:24:27,043 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:24:27,043 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:24:27,043 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:24:27,044 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:24:25" (3/4) ... [2024-11-07 08:24:27,046 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:24:27,047 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:24:27,049 INFO L158 Benchmark]: Toolchain (without parser) took 1941.71ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 49.5MB in the end (delta: 41.9MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2024-11-07 08:24:27,050 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 81.9MB in the end (delta: 77.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:24:27,050 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.70ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 78.5MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:24:27,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.69ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 76.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:24:27,051 INFO L158 Benchmark]: Boogie Preprocessor took 65.01ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 74.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:24:27,051 INFO L158 Benchmark]: RCFGBuilder took 443.11ms. Allocated memory is still 117.4MB. Free memory was 74.8MB in the beginning and 60.9MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:24:27,052 INFO L158 Benchmark]: TraceAbstraction took 1080.43ms. Allocated memory is still 117.4MB. Free memory was 60.4MB in the beginning and 49.5MB in the end (delta: 10.9MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2024-11-07 08:24:27,052 INFO L158 Benchmark]: Witness Printer took 4.27ms. Allocated memory is still 117.4MB. Free memory was 49.5MB in the beginning and 49.5MB in the end (delta: 34.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:24:27,054 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.32ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 81.9MB in the end (delta: 77.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.70ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 78.5MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.69ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 76.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.01ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 74.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 443.11ms. Allocated memory is still 117.4MB. Free memory was 74.8MB in the beginning and 60.9MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1080.43ms. Allocated memory is still 117.4MB. Free memory was 60.4MB in the beginning and 49.5MB in the end (delta: 10.9MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Witness Printer took 4.27ms. Allocated memory is still 117.4MB. Free memory was 49.5MB in the beginning and 49.5MB in the end (delta: 34.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 25; [L23] double var_1_2 = 63.25; [L24] double var_1_3 = 3.779; [L25] double var_1_4 = 31.6; [L26] double var_1_5 = 100.5; [L27] unsigned long int var_1_6 = 64; [L28] unsigned long int var_1_7 = 3150951169; [L29] unsigned long int var_1_8 = 128; [L30] unsigned char var_1_9 = 0; [L31] signed short int var_1_10 = -16; [L32] float var_1_11 = 127.075; [L33] float var_1_12 = 1.2; [L34] signed short int var_1_16 = 4; [L35] signed short int var_1_18 = -64; [L36] signed char var_1_19 = -32; VAL [isInitial=0, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_2=253/4, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L97] isInitial = 1 [L98] FCALL initially() [L99] int k_loop; [L100] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_2=253/4, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L100] COND TRUE k_loop < 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_double() [L66] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L66] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L67] var_1_3 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L68] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L69] var_1_4 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L70] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L71] var_1_5 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L72] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L73] var_1_6 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L75] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L76] var_1_7 = __VERIFIER_nondet_ulong() [L77] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=128, var_1_9=0] [L77] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=128, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_7 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=128, var_1_9=0] [L78] RET assume_abort_if_not(var_1_7 <= 4294967294) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=128, var_1_9=0] [L79] var_1_8 = __VERIFIER_nondet_ulong() [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_9=0] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=0] [L81] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=0] [L82] var_1_9 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649] [L83] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649] [L84] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] [L84] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] [L85] var_1_11 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] [L86] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] [L87] var_1_12 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] [L88] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] [L102] RET updateVariables() [L103] CALL step() [L40] COND TRUE ((((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) < (var_1_4)) ? (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) < var_1_5 [L41] var_1_1 = ((((var_1_6) > ((var_1_7 - var_1_8))) ? (var_1_6) : ((var_1_7 - var_1_8)))) VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=-8589934591, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] [L49] var_1_19 = -2 VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-2, var_1_1=-8589934591, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] [L50] COND TRUE \read(var_1_9) VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-2, var_1_1=-8589934591, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] [L51] COND TRUE 255.5f != (var_1_11 - var_1_12) [L52] var_1_10 = ((((((((var_1_19) > (var_1_19)) ? (var_1_19) : (var_1_19)))) > (var_1_19)) ? (((((var_1_19) > (var_1_19)) ? (var_1_19) : (var_1_19)))) : (var_1_19))) VAL [isInitial=1, var_1_10=-2, var_1_16=4, var_1_18=-64, var_1_19=-2, var_1_1=-8589934591, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] [L59] COND TRUE \read(var_1_9) [L60] var_1_16 = ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) VAL [isInitial=1, var_1_10=-2, var_1_16=2, var_1_18=-64, var_1_19=-2, var_1_1=-8589934591, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] [L62] var_1_18 = var_1_19 VAL [isInitial=1, var_1_10=-2, var_1_16=2, var_1_18=-2, var_1_19=-2, var_1_1=-8589934591, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] [L103] RET step() [L104] CALL, EXPR property() [L93-L94] return (((((((((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) < (var_1_4)) ? (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) < var_1_5) ? (var_1_1 == ((unsigned long int) ((((var_1_6) > ((var_1_7 - var_1_8))) ? (var_1_6) : ((var_1_7 - var_1_8)))))) : (var_1_9 ? (var_1_1 == ((unsigned long int) var_1_7)) : (var_1_1 == ((unsigned long int) var_1_6)))) && (var_1_9 ? ((255.5f != (var_1_11 - var_1_12)) ? (var_1_10 == ((signed short int) ((((((((var_1_19) > (var_1_19)) ? (var_1_19) : (var_1_19)))) > (var_1_19)) ? (((((var_1_19) > (var_1_19)) ? (var_1_19) : (var_1_19)))) : (var_1_19))))) : 1) : ((var_1_4 <= var_1_3) ? (var_1_10 == ((signed short int) var_1_19)) : 1))) && (var_1_9 ? (var_1_16 == ((signed short int) ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) : 1)) && (var_1_18 == ((signed short int) var_1_19))) && (var_1_19 == ((signed char) -2)) ; VAL [\result=0, isInitial=1, var_1_10=-2, var_1_16=2, var_1_18=-2, var_1_19=-2, var_1_1=-8589934591, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-2, var_1_16=2, var_1_18=-2, var_1_19=-2, var_1_1=-8589934591, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=-2, var_1_16=2, var_1_18=-2, var_1_19=-2, var_1_1=-8589934591, var_1_6=-8589934591, var_1_7=-6442450945, var_1_8=-2147483649, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 14, 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, 71 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, 71 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 94 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 364/364 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 08:24:27,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.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 192fd2fa21417aa09ed325872128b5046e8cfebc6357a29362e62278761c25b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:24:29,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:24:29,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:24:29,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:24:29,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:24:29,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:24:29,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:24:29,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:24:29,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:24:29,537 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:24:29,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:24:29,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:24:29,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:24:29,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:24:29,538 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:24:29,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:24:29,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:24:29,540 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:24:29,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:24:29,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:24:29,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:24:29,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:24:29,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:24:29,540 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:24:29,540 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:24:29,540 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:24:29,540 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:24:29,541 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:24:29,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:24:29,541 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:24:29,541 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:24:29,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:24:29,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:24:29,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:24:29,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:24:29,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:24:29,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:24:29,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:24:29,542 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:24:29,542 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:24:29,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:24:29,543 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:24:29,543 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:24:29,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:24:29,543 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 -> 192fd2fa21417aa09ed325872128b5046e8cfebc6357a29362e62278761c25b9 [2024-11-07 08:24:29,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:24:29,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:24:29,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:24:29,867 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:24:29,867 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:24:29,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i [2024-11-07 08:24:31,223 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:24:31,476 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:24:31,477 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i [2024-11-07 08:24:31,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42c127cd0/e4b45f0d7aa149c699d5ea405cb9657e/FLAG00f208e3b [2024-11-07 08:24:31,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42c127cd0/e4b45f0d7aa149c699d5ea405cb9657e [2024-11-07 08:24:31,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:24:31,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:24:31,516 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:24:31,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:24:31,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:24:31,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:24:31" (1/1) ... [2024-11-07 08:24:31,523 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc957e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:31, skipping insertion in model container [2024-11-07 08:24:31,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:24:31" (1/1) ... [2024-11-07 08:24:31,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:24:31,698 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i[915,928] [2024-11-07 08:24:31,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:24:31,785 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:24:31,797 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i[915,928] [2024-11-07 08:24:31,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:24:31,844 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:24:31,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:31 WrapperNode [2024-11-07 08:24:31,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:24:31,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:24:31,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:24:31,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:24:31,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:31" (1/1) ... [2024-11-07 08:24:31,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:31" (1/1) ... [2024-11-07 08:24:31,905 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-11-07 08:24:31,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:24:31,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:24:31,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:24:31,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:24:31,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:31" (1/1) ... [2024-11-07 08:24:31,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:31" (1/1) ... [2024-11-07 08:24:31,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:31" (1/1) ... [2024-11-07 08:24:31,939 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:24:31,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:31" (1/1) ... [2024-11-07 08:24:31,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:31" (1/1) ... [2024-11-07 08:24:31,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:31" (1/1) ... [2024-11-07 08:24:31,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:31" (1/1) ... [2024-11-07 08:24:31,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:31" (1/1) ... [2024-11-07 08:24:31,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:31" (1/1) ... [2024-11-07 08:24:31,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:24:31,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:24:31,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:24:31,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:24:31,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:31" (1/1) ... [2024-11-07 08:24:31,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:24:31,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:24:32,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:24:32,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:24:32,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:24:32,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:24:32,033 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:24:32,033 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:24:32,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:24:32,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:24:32,111 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:24:32,112 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:24:32,516 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-07 08:24:32,516 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:24:32,526 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:24:32,527 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:24:32,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:24:32 BoogieIcfgContainer [2024-11-07 08:24:32,527 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:24:32,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:24:32,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:24:32,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:24:32,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:24:31" (1/3) ... [2024-11-07 08:24:32,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3dad93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:24:32, skipping insertion in model container [2024-11-07 08:24:32,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:31" (2/3) ... [2024-11-07 08:24:32,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3dad93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:24:32, skipping insertion in model container [2024-11-07 08:24:32,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:24:32" (3/3) ... [2024-11-07 08:24:32,539 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-74.i [2024-11-07 08:24:32,552 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:24:32,553 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:24:32,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:24:32,632 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;@7bfbf19b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:24:32,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:24:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 08:24:32,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 08:24:32,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:24:32,665 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:24:32,665 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:24:32,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:24:32,672 INFO L85 PathProgramCache]: Analyzing trace with hash 571409010, now seen corresponding path program 1 times [2024-11-07 08:24:32,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:24:32,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544589689] [2024-11-07 08:24:32,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:24:32,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:24:32,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:24:32,688 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:24:32,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 08:24:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:24:32,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:24:32,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:24:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-07 08:24:32,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:24:32,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:24:32,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544589689] [2024-11-07 08:24:32,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544589689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:24:32,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:24:32,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:24:32,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996842436] [2024-11-07 08:24:32,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:24:32,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:24:32,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:24:32,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:24:32,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:24:32,990 INFO L87 Difference]: Start difference. First operand has 52 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 08:24:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:24:33,011 INFO L93 Difference]: Finished difference Result 101 states and 159 transitions. [2024-11-07 08:24:33,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:24:33,013 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2024-11-07 08:24:33,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:24:33,022 INFO L225 Difference]: With dead ends: 101 [2024-11-07 08:24:33,022 INFO L226 Difference]: Without dead ends: 48 [2024-11-07 08:24:33,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:24:33,031 INFO L432 NwaCegarLoop]: 71 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, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:24:33,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:24:33,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-07 08:24:33,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-07 08:24:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 08:24:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2024-11-07 08:24:33,081 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 95 [2024-11-07 08:24:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:24:33,082 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2024-11-07 08:24:33,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 08:24:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2024-11-07 08:24:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 08:24:33,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:24:33,086 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:24:33,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 08:24:33,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:24:33,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:24:33,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:24:33,293 INFO L85 PathProgramCache]: Analyzing trace with hash -588451738, now seen corresponding path program 1 times [2024-11-07 08:24:33,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:24:33,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632495945] [2024-11-07 08:24:33,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:24:33,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:24:33,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:24:33,297 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:24:33,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 08:24:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:24:33,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 08:24:33,528 INFO L278 TraceCheckSpWp]: Computing forward predicates...