./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.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-3.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', '4174816ef344926bad8876b5a23c69137012cf10d2912eee66c6eaf9797b3d25'] 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-3.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 4174816ef344926bad8876b5a23c69137012cf10d2912eee66c6eaf9797b3d25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:19:07,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:19:07,833 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:19:07,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:19:07,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:19:07,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:19:07,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:19:07,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:19:07,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:19:07,884 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:19:07,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:19:07,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:19:07,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:19:07,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:19:07,886 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:19:07,886 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:19:07,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:19:07,886 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:19:07,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:19:07,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:19:07,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:19:07,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:19:07,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:19:07,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:19:07,887 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:19:07,887 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:19:07,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:19:07,887 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:19:07,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:19:07,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:19:07,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:19:07,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:19:07,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:19:07,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:19:07,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:19:07,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:19:07,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:19:07,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:19:07,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:19:07,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:19:07,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:19:07,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:19:07,889 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 -> 4174816ef344926bad8876b5a23c69137012cf10d2912eee66c6eaf9797b3d25 [2024-11-07 08:19:08,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:19:08,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:19:08,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:19:08,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:19:08,213 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:19:08,214 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-3.i [2024-11-07 08:19:09,565 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:19:09,816 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:19:09,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.i [2024-11-07 08:19:09,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15c7bdd0d/851fbcfd7dc44adeb05cb4489e5797ac/FLAG9a9d6c291 [2024-11-07 08:19:09,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15c7bdd0d/851fbcfd7dc44adeb05cb4489e5797ac [2024-11-07 08:19:09,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:19:09,847 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:19:09,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:19:09,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:19:09,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:19:09,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:09" (1/1) ... [2024-11-07 08:19:09,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a0ab492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:09, skipping insertion in model container [2024-11-07 08:19:09,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:09" (1/1) ... [2024-11-07 08:19:09,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:19:10,007 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-3.i[914,927] [2024-11-07 08:19:10,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:19:10,082 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:19:10,094 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-3.i[914,927] [2024-11-07 08:19:10,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:19:10,137 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:19:10,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:10 WrapperNode [2024-11-07 08:19:10,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:19:10,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:19:10,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:19:10,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:19:10,145 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:19:10" (1/1) ... [2024-11-07 08:19:10,157 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:19:10" (1/1) ... [2024-11-07 08:19:10,187 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-07 08:19:10,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:19:10,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:19:10,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:19:10,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:19:10,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:10" (1/1) ... [2024-11-07 08:19:10,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:10" (1/1) ... [2024-11-07 08:19:10,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:10" (1/1) ... [2024-11-07 08:19:10,224 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:19:10,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:10" (1/1) ... [2024-11-07 08:19:10,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:10" (1/1) ... [2024-11-07 08:19:10,229 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:10" (1/1) ... [2024-11-07 08:19:10,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:10" (1/1) ... [2024-11-07 08:19:10,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:10" (1/1) ... [2024-11-07 08:19:10,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:10" (1/1) ... [2024-11-07 08:19:10,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:19:10,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:19:10,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:19:10,253 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:19:10,254 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:10" (1/1) ... [2024-11-07 08:19:10,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:19:10,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:19:10,298 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:19:10,303 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:19:10,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:19:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:19:10,322 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:19:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:19:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:19:10,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:19:10,387 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:19:10,390 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:19:10,667 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-07 08:19:10,667 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:19:10,685 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:19:10,686 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:19:10,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:10 BoogieIcfgContainer [2024-11-07 08:19:10,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:19:10,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:19:10,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:19:10,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:19:10,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:19:09" (1/3) ... [2024-11-07 08:19:10,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d94673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:19:10, skipping insertion in model container [2024-11-07 08:19:10,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:10" (2/3) ... [2024-11-07 08:19:10,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d94673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:19:10, skipping insertion in model container [2024-11-07 08:19:10,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:10" (3/3) ... [2024-11-07 08:19:10,698 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-3.i [2024-11-07 08:19:10,713 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:19:10,713 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:19:10,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:19:10,793 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;@888f67c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:19:10,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:19:10,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 08:19:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 08:19:10,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:10,813 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:10,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:10,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:10,819 INFO L85 PathProgramCache]: Analyzing trace with hash 104122836, now seen corresponding path program 1 times [2024-11-07 08:19:10,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:10,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490884322] [2024-11-07 08:19:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:10,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:19:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:19:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:19:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:19:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:19:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:19:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:19:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:19:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:19:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:19:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:19:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:19:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:19:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:19:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:19:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 08:19:11,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:19:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490884322] [2024-11-07 08:19:11,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490884322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:19:11,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:19:11,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:19:11,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194869550] [2024-11-07 08:19:11,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:19:11,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:19:11,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:19:11,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:19:11,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:19:11,229 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 08:19:11,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:11,254 INFO L93 Difference]: Finished difference Result 97 states and 156 transitions. [2024-11-07 08:19:11,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:19:11,258 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-11-07 08:19:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:11,264 INFO L225 Difference]: With dead ends: 97 [2024-11-07 08:19:11,265 INFO L226 Difference]: Without dead ends: 46 [2024-11-07 08:19:11,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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:19:11,271 INFO L432 NwaCegarLoop]: 69 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, 69 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:19:11,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:19:11,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-07 08:19:11,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-07 08:19:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 08:19:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-07 08:19:11,312 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 97 [2024-11-07 08:19:11,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:11,313 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-07 08:19:11,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 08:19:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-07 08:19:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 08:19:11,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:11,317 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:11,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:19:11,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:11,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:11,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1453420334, now seen corresponding path program 1 times [2024-11-07 08:19:11,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:11,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612484126] [2024-11-07 08:19:11,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:11,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:19:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:19:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:19:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:19:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:19:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:19:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:19:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:19:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:19:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:19:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:19:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:19:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:19:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:11,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:19:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:12,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:19:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-07 08:19:12,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:19:12,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612484126] [2024-11-07 08:19:12,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612484126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:19:12,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945286180] [2024-11-07 08:19:12,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:12,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:19:12,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:19:12,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:19:12,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 08:19:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:12,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 08:19:12,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:19:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 08:19:12,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:19:12,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945286180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:19:12,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:19:12,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2024-11-07 08:19:12,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131837774] [2024-11-07 08:19:12,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:19:12,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 08:19:12,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:19:12,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 08:19:12,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:19:12,341 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 08:19:12,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:12,881 INFO L93 Difference]: Finished difference Result 123 states and 172 transitions. [2024-11-07 08:19:12,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 08:19:12,882 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-11-07 08:19:12,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:12,884 INFO L225 Difference]: With dead ends: 123 [2024-11-07 08:19:12,884 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 08:19:12,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-11-07 08:19:12,886 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 109 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:19:12,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 201 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:19:12,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 08:19:12,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2024-11-07 08:19:12,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 08:19:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2024-11-07 08:19:12,917 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 104 transitions. Word has length 97 [2024-11-07 08:19:12,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:12,918 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 104 transitions. [2024-11-07 08:19:12,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 08:19:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2024-11-07 08:19:12,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 08:19:12,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:12,921 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:12,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 08:19:13,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:19:13,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:13,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:13,122 INFO L85 PathProgramCache]: Analyzing trace with hash -773361964, now seen corresponding path program 1 times [2024-11-07 08:19:13,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:19:13,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699640390] [2024-11-07 08:19:13,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:13,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:19:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:19:13,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:19:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:19:13,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:19:13,308 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:19:13,309 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:19:13,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:19:13,318 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 08:19:13,407 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:19:13,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:19:13 BoogieIcfgContainer [2024-11-07 08:19:13,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:19:13,412 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:19:13,412 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:19:13,412 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:19:13,413 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:10" (3/4) ... [2024-11-07 08:19:13,415 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:19:13,416 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:19:13,418 INFO L158 Benchmark]: Toolchain (without parser) took 3570.40ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 91.9MB in the beginning and 94.8MB in the end (delta: -3.0MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2024-11-07 08:19:13,418 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:19:13,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.39ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 79.6MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:19:13,419 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.08ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 77.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:19:13,420 INFO L158 Benchmark]: Boogie Preprocessor took 54.70ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 75.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:19:13,420 INFO L158 Benchmark]: RCFGBuilder took 437.35ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 61.2MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:19:13,420 INFO L158 Benchmark]: TraceAbstraction took 2721.85ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 60.6MB in the beginning and 95.8MB in the end (delta: -35.2MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2024-11-07 08:19:13,420 INFO L158 Benchmark]: Witness Printer took 4.39ms. Allocated memory is still 159.4MB. Free memory was 95.8MB in the beginning and 94.8MB in the end (delta: 935.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:19:13,422 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.89ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.39ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 79.6MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.08ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 77.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.70ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 75.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 437.35ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 61.2MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2721.85ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 60.6MB in the beginning and 95.8MB in the end (delta: -35.2MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Witness Printer took 4.39ms. Allocated memory is still 159.4MB. Free memory was 95.8MB in the beginning and 94.8MB in the end (delta: 935.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 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] signed long int var_1_6 = -64; [L26] signed long int var_1_7 = -5; [L27] signed long int var_1_8 = 500; [L28] signed long int var_1_9 = -5; [L29] signed long int var_1_10 = -100; [L30] unsigned char var_1_11 = 1; [L31] double var_1_12 = 127.5; [L32] double var_1_13 = 7.25; [L33] unsigned char var_1_14 = 1; [L34] unsigned char var_1_15 = 0; VAL [isInitial=0, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L93] isInitial = 1 [L94] FCALL initially() [L95] int k_loop; [L96] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L96] COND TRUE k_loop < 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L62] var_1_4 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L63] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L64] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L64] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L65] var_1_5 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L66] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L67] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L67] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L68] var_1_7 = __VERIFIER_nondet_long() [L69] CALL assume_abort_if_not(var_1_7 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L69] RET assume_abort_if_not(var_1_7 >= -1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L70] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L70] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L71] var_1_8 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L72] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L73] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L73] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L74] var_1_9 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_9 >= -536870912) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L75] RET assume_abort_if_not(var_1_9 >= -536870912) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L76] CALL assume_abort_if_not(var_1_9 <= 536870912) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L76] RET assume_abort_if_not(var_1_9 <= 536870912) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L77] var_1_10 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_10 >= -536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L78] RET assume_abort_if_not(var_1_10 >= -536870911) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L79] CALL assume_abort_if_not(var_1_10 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L79] RET assume_abort_if_not(var_1_10 <= 536870911) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L80] var_1_13 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L81] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L82] var_1_15 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L83] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L84] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L84] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L98] RET updateVariables() [L99] CALL step() [L38] var_1_12 = var_1_13 [L39] var_1_14 = var_1_15 VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L40] COND FALSE !(! var_1_14) [L43] var_1_6 = ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L45] signed long int stepLocal_2 = var_1_7; [L46] signed long int stepLocal_1 = var_1_9; VAL [isInitial=1, stepLocal_1=536870912, stepLocal_2=1073741821, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L47] COND FALSE !(var_1_8 <= stepLocal_2) VAL [isInitial=1, stepLocal_1=536870912, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L54] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=-255, stepLocal_1=536870912, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L55] COND FALSE !(! var_1_11) VAL [isInitial=1, stepLocal_0=-255, stepLocal_1=536870912, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L99] RET step() [L100] CALL, EXPR property() [L89-L90] return (((((! var_1_11) ? ((var_1_11 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : 1) : 1) && ((! var_1_14) ? (var_1_6 == ((signed long int) (var_1_7 + var_1_8))) : (var_1_6 == ((signed long int) ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7))))) && ((var_1_8 <= var_1_7) ? ((var_1_10 >= var_1_9) ? (var_1_11 == ((unsigned char) (! var_1_5))) : (var_1_11 == ((unsigned char) (var_1_14 || (! var_1_5))))) : 1)) && (var_1_12 == ((double) var_1_13))) && (var_1_14 == ((unsigned char) var_1_15)) ; VAL [\result=0, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L19] reach_error() VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 270 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 136 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=2, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 370 SizeOfPredicates, 1 NumberOfNonLiveVariables, 230 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1257/1260 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:19:13,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.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 4174816ef344926bad8876b5a23c69137012cf10d2912eee66c6eaf9797b3d25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:19:15,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:19:15,944 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:19:15,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:19:15,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:19:15,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:19:15,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:19:15,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:19:15,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:19:15,986 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:19:15,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:19:15,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:19:15,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:19:15,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:19:15,986 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:19:15,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:19:15,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:19:15,987 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:19:15,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:19:15,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:19:15,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:19:15,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:19:15,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:19:15,989 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:19:15,990 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:19:15,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:19:15,990 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:19:15,990 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:19:15,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:19:15,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:19:15,990 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:19:15,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:19:15,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:19:15,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:19:15,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:19:15,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:19:15,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:19:15,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:19:15,991 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:19:15,992 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:19:15,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:19:15,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:19:15,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:19:15,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:19:15,992 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 -> 4174816ef344926bad8876b5a23c69137012cf10d2912eee66c6eaf9797b3d25 [2024-11-07 08:19:16,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:19:16,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:19:16,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:19:16,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:19:16,334 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:19:16,335 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-3.i [2024-11-07 08:19:17,802 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:19:18,086 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:19:18,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.i [2024-11-07 08:19:18,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e02d50b34/14c1cb64199f434c96f673909ff6c531/FLAGc27ff70a1 [2024-11-07 08:19:18,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e02d50b34/14c1cb64199f434c96f673909ff6c531 [2024-11-07 08:19:18,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:19:18,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:19:18,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:19:18,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:19:18,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:19:18,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:18" (1/1) ... [2024-11-07 08:19:18,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e644821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:18, skipping insertion in model container [2024-11-07 08:19:18,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:18" (1/1) ... [2024-11-07 08:19:18,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:19:18,303 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-3.i[914,927] [2024-11-07 08:19:18,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:19:18,381 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:19:18,395 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-3.i[914,927] [2024-11-07 08:19:18,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:19:18,445 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:19:18,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:18 WrapperNode [2024-11-07 08:19:18,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:19:18,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:19:18,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:19:18,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:19:18,457 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:19:18" (1/1) ... [2024-11-07 08:19:18,473 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:19:18" (1/1) ... [2024-11-07 08:19:18,501 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-11-07 08:19:18,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:19:18,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:19:18,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:19:18,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:19:18,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:18" (1/1) ... [2024-11-07 08:19:18,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:18" (1/1) ... [2024-11-07 08:19:18,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:18" (1/1) ... [2024-11-07 08:19:18,538 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:19:18,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:18" (1/1) ... [2024-11-07 08:19:18,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:18" (1/1) ... [2024-11-07 08:19:18,546 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:18" (1/1) ... [2024-11-07 08:19:18,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:18" (1/1) ... [2024-11-07 08:19:18,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:18" (1/1) ... [2024-11-07 08:19:18,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:18" (1/1) ... [2024-11-07 08:19:18,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:19:18,562 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:19:18,562 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:19:18,562 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:19:18,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:18" (1/1) ... [2024-11-07 08:19:18,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:19:18,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:19:18,599 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:19:18,603 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:19:18,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:19:18,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:19:18,626 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:19:18,626 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:19:18,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:19:18,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:19:18,713 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:19:18,714 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:19:19,006 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-07 08:19:19,007 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:19:19,018 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:19:19,020 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:19:19,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:19 BoogieIcfgContainer [2024-11-07 08:19:19,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:19:19,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:19:19,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:19:19,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:19:19,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:19:18" (1/3) ... [2024-11-07 08:19:19,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791bb364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:19:19, skipping insertion in model container [2024-11-07 08:19:19,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:18" (2/3) ... [2024-11-07 08:19:19,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791bb364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:19:19, skipping insertion in model container [2024-11-07 08:19:19,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:19" (3/3) ... [2024-11-07 08:19:19,034 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-3.i [2024-11-07 08:19:19,048 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:19:19,048 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:19:19,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:19:19,117 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;@336acc7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:19:19,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:19:19,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 08:19:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 08:19:19,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:19,135 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:19,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:19,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:19,141 INFO L85 PathProgramCache]: Analyzing trace with hash 104122836, now seen corresponding path program 1 times [2024-11-07 08:19:19,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:19:19,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79474491] [2024-11-07 08:19:19,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:19,177 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:19:19,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:19:19,181 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:19:19,183 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:19:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:19,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:19:19,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:19:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-07 08:19:19,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:19:19,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:19:19,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79474491] [2024-11-07 08:19:19,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79474491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:19:19,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:19:19,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:19:19,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269726538] [2024-11-07 08:19:19,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:19:19,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:19:19,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:19:19,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:19:19,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:19:19,445 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 08:19:19,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:19,468 INFO L93 Difference]: Finished difference Result 97 states and 156 transitions. [2024-11-07 08:19:19,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:19:19,471 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-11-07 08:19:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:19,476 INFO L225 Difference]: With dead ends: 97 [2024-11-07 08:19:19,476 INFO L226 Difference]: Without dead ends: 46 [2024-11-07 08:19:19,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 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:19:19,481 INFO L432 NwaCegarLoop]: 69 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, 69 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:19:19,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:19:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-07 08:19:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-07 08:19:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 08:19:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-07 08:19:19,524 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 97 [2024-11-07 08:19:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:19,525 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-07 08:19:19,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 08:19:19,525 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-07 08:19:19,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 08:19:19,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:19,529 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:19,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 08:19:19,730 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:19:19,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:19,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:19,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1453420334, now seen corresponding path program 1 times [2024-11-07 08:19:19,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:19:19,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077981880] [2024-11-07 08:19:19,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:19,732 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:19:19,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:19:19,736 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:19:19,738 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:19:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:19,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 08:19:19,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:19:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 08:19:20,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:19:20,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:19:20,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077981880] [2024-11-07 08:19:20,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077981880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:19:20,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:19:20,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 08:19:20,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489529393] [2024-11-07 08:19:20,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:19:20,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 08:19:20,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:19:20,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 08:19:20,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 08:19:20,122 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 08:19:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:19:20,773 INFO L93 Difference]: Finished difference Result 123 states and 172 transitions. [2024-11-07 08:19:20,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 08:19:20,774 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-11-07 08:19:20,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:19:20,776 INFO L225 Difference]: With dead ends: 123 [2024-11-07 08:19:20,776 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 08:19:20,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 08:19:20,777 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 109 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:19:20,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 166 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 08:19:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 08:19:20,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2024-11-07 08:19:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 08:19:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2024-11-07 08:19:20,802 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 104 transitions. Word has length 97 [2024-11-07 08:19:20,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:19:20,803 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 104 transitions. [2024-11-07 08:19:20,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 08:19:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2024-11-07 08:19:20,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 08:19:20,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:19:20,804 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:20,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 08:19:21,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:19:21,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:19:21,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:19:21,006 INFO L85 PathProgramCache]: Analyzing trace with hash -773361964, now seen corresponding path program 1 times [2024-11-07 08:19:21,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:19:21,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904964874] [2024-11-07 08:19:21,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:19:21,007 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:19:21,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:19:21,011 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:19:21,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 08:19:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:19:21,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 08:19:21,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:20:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 157 proven. 128 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-07 08:20:39,115 INFO L311 TraceCheckSpWp]: Computing backward predicates...