./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-43.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_variablewrapping_normal_file-43.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', '1b276dadabf1c2167b11901ba656aa9e16f5041ffd48790c84fa96230d4114a3'] 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_variablewrapping_normal_file-43.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 1b276dadabf1c2167b11901ba656aa9e16f5041ffd48790c84fa96230d4114a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:02:01,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:02:02,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:02:02,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:02:02,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:02:02,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:02:02,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:02:02,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:02:02,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:02:02,078 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:02:02,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:02:02,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:02:02,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:02:02,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:02:02,079 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:02:02,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:02:02,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:02:02,080 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:02:02,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:02:02,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:02:02,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:02:02,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:02:02,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:02:02,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:02:02,080 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:02:02,080 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:02:02,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:02:02,080 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:02:02,080 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:02:02,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:02:02,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:02:02,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:02:02,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:02:02,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:02:02,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:02:02,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:02:02,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:02:02,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:02:02,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:02:02,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:02:02,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:02:02,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:02:02,081 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 -> 1b276dadabf1c2167b11901ba656aa9e16f5041ffd48790c84fa96230d4114a3 [2024-11-07 10:02:02,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:02:02,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:02:02,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:02:02,318 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:02:02,318 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:02:02,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-43.i [2024-11-07 10:02:03,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:02:03,657 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:02:03,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-43.i [2024-11-07 10:02:03,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8543b7b0e/c100278fc2784ab197f09a8fea9d8185/FLAG5fcda86ef [2024-11-07 10:02:03,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8543b7b0e/c100278fc2784ab197f09a8fea9d8185 [2024-11-07 10:02:04,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:02:04,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:02:04,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:02:04,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:02:04,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:02:04,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:02:03" (1/1) ... [2024-11-07 10:02:04,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db15f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:04, skipping insertion in model container [2024-11-07 10:02:04,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:02:03" (1/1) ... [2024-11-07 10:02:04,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:02:04,110 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_variablewrapping_normal_file-43.i[913,926] [2024-11-07 10:02:04,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:02:04,154 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:02:04,161 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_variablewrapping_normal_file-43.i[913,926] [2024-11-07 10:02:04,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:02:04,185 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:02:04,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:04 WrapperNode [2024-11-07 10:02:04,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:02:04,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:02:04,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:02:04,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:02:04,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:04" (1/1) ... [2024-11-07 10:02:04,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:04" (1/1) ... [2024-11-07 10:02:04,228 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-11-07 10:02:04,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:02:04,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:02:04,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:02:04,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:02:04,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:04" (1/1) ... [2024-11-07 10:02:04,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:04" (1/1) ... [2024-11-07 10:02:04,239 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:04" (1/1) ... [2024-11-07 10:02:04,256 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 10:02:04,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:04" (1/1) ... [2024-11-07 10:02:04,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:04" (1/1) ... [2024-11-07 10:02:04,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:04" (1/1) ... [2024-11-07 10:02:04,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:04" (1/1) ... [2024-11-07 10:02:04,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:04" (1/1) ... [2024-11-07 10:02:04,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:04" (1/1) ... [2024-11-07 10:02:04,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:02:04,274 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:02:04,274 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:02:04,274 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:02:04,275 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:04" (1/1) ... [2024-11-07 10:02:04,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:02:04,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:02:04,299 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 10:02:04,304 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 10:02:04,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:02:04,318 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:02:04,319 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:02:04,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:02:04,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:02:04,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:02:04,390 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:02:04,392 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:02:04,632 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-07 10:02:04,633 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:02:04,642 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:02:04,642 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:02:04,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:02:04 BoogieIcfgContainer [2024-11-07 10:02:04,642 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:02:04,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:02:04,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:02:04,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:02:04,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:02:03" (1/3) ... [2024-11-07 10:02:04,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1989e64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:02:04, skipping insertion in model container [2024-11-07 10:02:04,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:04" (2/3) ... [2024-11-07 10:02:04,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1989e64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:02:04, skipping insertion in model container [2024-11-07 10:02:04,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:02:04" (3/3) ... [2024-11-07 10:02:04,649 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-43.i [2024-11-07 10:02:04,659 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:02:04,660 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:02:04,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:02:04,709 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;@22418e70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:02:04,709 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:02:04,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:02:04,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 10:02:04,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:02:04,719 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:04,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:02:04,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:02:04,723 INFO L85 PathProgramCache]: Analyzing trace with hash 762234100, now seen corresponding path program 1 times [2024-11-07 10:02:04,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:02:04,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442452937] [2024-11-07 10:02:04,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:02:04,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:02:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:02:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:02:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:02:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:02:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:02:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 10:02:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 10:02:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 10:02:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 10:02:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:02:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:02:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 10:02:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 10:02:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 10:02:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 10:02:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:02:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:02:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 10:02:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 10:02:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 10:02:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 10:02:05,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:02:05,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442452937] [2024-11-07 10:02:05,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442452937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:02:05,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525748374] [2024-11-07 10:02:05,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:02:05,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:02:05,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:02:05,379 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 10:02:05,381 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 10:02:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:05,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 10:02:05,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:02:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-07 10:02:05,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:02:05,792 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 10:02:05,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525748374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:02:05,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:02:05,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-07 10:02:05,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413181183] [2024-11-07 10:02:05,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:02:05,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:02:05,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:02:05,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:02:05,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:02:05,813 INFO L87 Difference]: Start difference. First operand has 77 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-07 10:02:05,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:02:05,977 INFO L93 Difference]: Finished difference Result 153 states and 251 transitions. [2024-11-07 10:02:05,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:02:05,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 133 [2024-11-07 10:02:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:02:05,986 INFO L225 Difference]: With dead ends: 153 [2024-11-07 10:02:05,986 INFO L226 Difference]: Without dead ends: 79 [2024-11-07 10:02:05,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:02:05,991 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 107 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:02:05,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 174 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:02:06,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-07 10:02:06,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2024-11-07 10:02:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 54 states have internal predecessors, (69), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:02:06,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2024-11-07 10:02:06,020 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 133 [2024-11-07 10:02:06,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:02:06,021 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2024-11-07 10:02:06,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-07 10:02:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2024-11-07 10:02:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:02:06,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:02:06,023 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:06,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 10:02:06,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-07 10:02:06,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:02:06,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:02:06,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1706975839, now seen corresponding path program 1 times [2024-11-07 10:02:06,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:02:06,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928856045] [2024-11-07 10:02:06,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:02:06,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:02:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:02:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:02:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:02:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:02:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:02:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 10:02:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 10:02:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 10:02:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 10:02:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:02:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:02:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 10:02:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 10:02:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 10:02:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 10:02:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:02:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:02:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 10:02:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 10:02:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 10:02:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 10:02:06,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:02:06,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928856045] [2024-11-07 10:02:06,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928856045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:02:06,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803434869] [2024-11-07 10:02:06,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:02:06,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:02:06,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:02:06,555 INFO L229 MonitoredProcess]: Starting monitored process 3 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 10:02:06,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 10:02:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:06,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:02:06,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:02:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-07 10:02:06,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:02:06,995 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 10:02:06,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803434869] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:02:06,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:02:06,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2024-11-07 10:02:06,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882812375] [2024-11-07 10:02:06,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:02:06,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 10:02:06,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:02:06,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 10:02:06,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:02:06,997 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 4 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2024-11-07 10:02:07,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:02:07,235 INFO L93 Difference]: Finished difference Result 155 states and 220 transitions. [2024-11-07 10:02:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:02:07,236 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 4 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) Word has length 134 [2024-11-07 10:02:07,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:02:07,237 INFO L225 Difference]: With dead ends: 155 [2024-11-07 10:02:07,237 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 10:02:07,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2024-11-07 10:02:07,238 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 107 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:02:07,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 308 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:02:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 10:02:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-11-07 10:02:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:02:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 111 transitions. [2024-11-07 10:02:07,247 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 111 transitions. Word has length 134 [2024-11-07 10:02:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:02:07,247 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 111 transitions. [2024-11-07 10:02:07,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 4 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2024-11-07 10:02:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 111 transitions. [2024-11-07 10:02:07,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:02:07,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:02:07,250 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:07,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 10:02:07,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:02:07,451 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:02:07,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:02:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1448810401, now seen corresponding path program 1 times [2024-11-07 10:02:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:02:07,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064987698] [2024-11-07 10:02:07,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:02:07,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:02:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:02:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:02:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:02:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:02:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:02:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 10:02:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 10:02:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 10:02:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 10:02:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:02:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:02:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 10:02:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 10:02:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 10:02:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 10:02:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:02:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:02:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 10:02:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 10:02:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 10:02:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 10:02:07,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:02:07,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064987698] [2024-11-07 10:02:07,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064987698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:02:07,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:02:07,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:02:07,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515399914] [2024-11-07 10:02:07,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:02:07,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:02:07,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:02:07,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:02:07,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:02:07,749 INFO L87 Difference]: Start difference. First operand 79 states and 111 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:02:07,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:02:07,946 INFO L93 Difference]: Finished difference Result 163 states and 226 transitions. [2024-11-07 10:02:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:02:07,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2024-11-07 10:02:07,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:02:07,949 INFO L225 Difference]: With dead ends: 163 [2024-11-07 10:02:07,949 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 10:02:07,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:02:07,952 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 126 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:02:07,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 193 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:02:07,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 10:02:07,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2024-11-07 10:02:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:02:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 112 transitions. [2024-11-07 10:02:07,968 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 112 transitions. Word has length 134 [2024-11-07 10:02:07,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:02:07,968 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 112 transitions. [2024-11-07 10:02:07,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:02:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2024-11-07 10:02:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:02:07,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:02:07,971 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:07,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:02:07,971 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:02:07,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:02:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1841837411, now seen corresponding path program 1 times [2024-11-07 10:02:07,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:02:07,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261175267] [2024-11-07 10:02:07,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:02:07,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:02:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:02:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:02:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:02:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:02:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:02:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 10:02:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 10:02:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 10:02:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 10:02:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:02:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:02:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 10:02:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 10:02:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 10:02:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 10:02:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:02:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:02:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 10:02:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 10:02:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 10:02:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:02:08,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:02:08,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261175267] [2024-11-07 10:02:08,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261175267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:02:08,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:02:08,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:02:08,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364096711] [2024-11-07 10:02:08,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:02:08,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:02:08,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:02:08,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:02:08,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:02:08,112 INFO L87 Difference]: Start difference. First operand 83 states and 112 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:02:08,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:02:08,165 INFO L93 Difference]: Finished difference Result 228 states and 308 transitions. [2024-11-07 10:02:08,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:02:08,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2024-11-07 10:02:08,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:02:08,168 INFO L225 Difference]: With dead ends: 228 [2024-11-07 10:02:08,169 INFO L226 Difference]: Without dead ends: 148 [2024-11-07 10:02:08,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:02:08,170 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 78 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:02:08,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 428 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:02:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-07 10:02:08,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 86. [2024-11-07 10:02:08,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:02:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 115 transitions. [2024-11-07 10:02:08,190 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 115 transitions. Word has length 134 [2024-11-07 10:02:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:02:08,191 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 115 transitions. [2024-11-07 10:02:08,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:02:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2024-11-07 10:02:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:02:08,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:02:08,194 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:08,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:02:08,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:02:08,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:02:08,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1220979613, now seen corresponding path program 1 times [2024-11-07 10:02:08,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:02:08,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727878329] [2024-11-07 10:02:08,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:02:08,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:02:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:02:08,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [550213586] [2024-11-07 10:02:08,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:02:08,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:02:08,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:02:08,261 INFO L229 MonitoredProcess]: Starting monitored process 4 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 10:02:08,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 10:02:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:02:08,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:02:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:02:08,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:02:08,442 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:02:08,443 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:02:08,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 10:02:08,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:02:08,647 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 10:02:08,709 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:02:08,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:02:08 BoogieIcfgContainer [2024-11-07 10:02:08,711 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:02:08,712 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:02:08,712 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:02:08,712 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:02:08,712 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:02:04" (3/4) ... [2024-11-07 10:02:08,714 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:02:08,714 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:02:08,715 INFO L158 Benchmark]: Toolchain (without parser) took 4713.85ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 84.9MB in the beginning and 81.5MB in the end (delta: 3.4MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2024-11-07 10:02:08,715 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:02:08,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.22ms. Allocated memory is still 109.1MB. Free memory was 84.7MB in the beginning and 71.7MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:02:08,716 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.25ms. Allocated memory is still 109.1MB. Free memory was 71.7MB in the beginning and 69.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:02:08,716 INFO L158 Benchmark]: Boogie Preprocessor took 44.74ms. Allocated memory is still 109.1MB. Free memory was 69.1MB in the beginning and 66.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:02:08,716 INFO L158 Benchmark]: RCFGBuilder took 368.16ms. Allocated memory is still 109.1MB. Free memory was 65.9MB in the beginning and 47.1MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:02:08,716 INFO L158 Benchmark]: TraceAbstraction took 4067.30ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 46.5MB in the beginning and 82.5MB in the end (delta: -36.0MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-11-07 10:02:08,716 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 81.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:02:08,717 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.20ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.22ms. Allocated memory is still 109.1MB. Free memory was 84.7MB in the beginning and 71.7MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.25ms. Allocated memory is still 109.1MB. Free memory was 71.7MB in the beginning and 69.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.74ms. Allocated memory is still 109.1MB. Free memory was 69.1MB in the beginning and 66.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 368.16ms. Allocated memory is still 109.1MB. Free memory was 65.9MB in the beginning and 47.1MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4067.30ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 46.5MB in the beginning and 82.5MB in the end (delta: -36.0MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 81.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 108. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] float var_1_2 = 4.5; [L24] float var_1_3 = 64.8; [L25] float var_1_4 = 64.4; [L26] float var_1_5 = 0.2; [L27] signed short int var_1_7 = 10000; [L28] signed short int var_1_8 = 1; [L29] signed short int var_1_9 = 50; [L30] signed short int var_1_10 = 8; [L31] unsigned char var_1_13 = 2; [L32] unsigned char var_1_14 = 100; [L33] unsigned short int var_1_15 = 128; [L34] unsigned short int var_1_16 = 23647; [L35] unsigned short int var_1_17 = 32; [L36] signed char var_1_18 = 0; [L37] signed char var_1_19 = -50; [L38] unsigned char var_1_20 = 0; [L39] unsigned char var_1_21 = 0; VAL [isInitial=0, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=9/2, var_1_3=324/5, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] FCALL updateLastVariables() [L116] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_3=324/5, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_3=324/5, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L73] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_3=324/5, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L74] var_1_3 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L75] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L76] var_1_4 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L77] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L78] var_1_5 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L79] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L80] var_1_7 = __VERIFIER_nondet_short() [L81] CALL assume_abort_if_not(var_1_7 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L81] RET assume_abort_if_not(var_1_7 >= 8191) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L82] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L82] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L83] var_1_8 = __VERIFIER_nondet_short() [L84] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L84] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L85] CALL assume_abort_if_not(var_1_8 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L85] RET assume_abort_if_not(var_1_8 <= 8192) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L86] var_1_9 = __VERIFIER_nondet_short() [L87] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_9 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L88] RET assume_abort_if_not(var_1_9 <= 8191) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L89] var_1_10 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L91] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L92] var_1_14 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L94] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L95] var_1_16 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L96] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L97] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L97] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L98] var_1_19 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L99] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L100] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L100] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L101] var_1_21 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L102] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L103] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L103] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L116] RET updateVariables() [L117] CALL step() [L43] var_1_18 = var_1_19 [L44] var_1_20 = var_1_21 [L45] signed char stepLocal_1 = var_1_18; [L46] signed long int stepLocal_0 = var_1_9 / var_1_7; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L47] EXPR var_1_8 << var_1_10 VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L47] COND FALSE !(stepLocal_1 > (var_1_8 << var_1_10)) [L54] EXPR var_1_7 ^ var_1_18 VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L54] signed long int stepLocal_2 = var_1_7 ^ var_1_18; [L55] COND FALSE !(var_1_14 >= stepLocal_2) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L58] COND TRUE var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5)))) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L59] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L69] var_1_17 = var_1_1 VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=64, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR ((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=64, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L108] EXPR (((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1)) && ((var_1_14 >= (var_1_7 ^ var_1_18)) ? (var_1_15 == ((unsigned short int) (var_1_14 + (var_1_16 - var_1_13)))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=64, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L108-L109] return ((((((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1)) && ((var_1_14 >= (var_1_7 ^ var_1_18)) ? (var_1_15 == ((unsigned short int) (var_1_14 + (var_1_16 - var_1_13)))) : 1)) && (var_1_17 == ((unsigned short int) var_1_1))) && (var_1_18 == ((signed char) var_1_19))) && (var_1_20 == ((unsigned char) var_1_21)) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=64, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=64, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 428 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 418 mSDsluCounter, 1103 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 712 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 537 IncrementalHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 391 mSDtfsCounter, 537 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 728 GetRequests, 687 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=4, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 70 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1070 NumberOfCodeBlocks, 1070 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1061 ConstructedInterpolants, 0 QuantifiedInterpolants, 1847 SizeOfPredicates, 2 NumberOfNonLiveVariables, 609 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 5810/6080 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 10:02:08,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-43.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 1b276dadabf1c2167b11901ba656aa9e16f5041ffd48790c84fa96230d4114a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:02:10,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:02:10,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:02:10,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:02:10,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:02:10,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:02:10,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:02:10,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:02:10,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:02:10,584 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:02:10,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:02:10,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:02:10,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:02:10,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:02:10,584 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:02:10,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:02:10,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:02:10,584 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:02:10,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:02:10,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:02:10,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:02:10,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:02:10,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:02:10,585 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:02:10,585 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:02:10,585 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:02:10,585 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:02:10,585 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:02:10,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:02:10,585 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:02:10,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:02:10,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:02:10,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:02:10,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:02:10,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:02:10,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:02:10,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:02:10,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:02:10,585 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:02:10,585 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:02:10,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:02:10,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:02:10,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:02:10,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:02:10,586 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 -> 1b276dadabf1c2167b11901ba656aa9e16f5041ffd48790c84fa96230d4114a3 [2024-11-07 10:02:10,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:02:10,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:02:10,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:02:10,835 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:02:10,836 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:02:10,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-43.i [2024-11-07 10:02:11,946 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:02:12,168 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:02:12,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-43.i [2024-11-07 10:02:12,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/143b3aa3c/09c88814349f4240b60ece9c5d6922ef/FLAG6d795c794 [2024-11-07 10:02:12,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/143b3aa3c/09c88814349f4240b60ece9c5d6922ef [2024-11-07 10:02:12,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:02:12,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:02:12,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:02:12,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:02:12,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:02:12,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:02:12" (1/1) ... [2024-11-07 10:02:12,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@452000bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:12, skipping insertion in model container [2024-11-07 10:02:12,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:02:12" (1/1) ... [2024-11-07 10:02:12,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:02:12,648 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_variablewrapping_normal_file-43.i[913,926] [2024-11-07 10:02:12,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:02:12,693 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:02:12,702 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_variablewrapping_normal_file-43.i[913,926] [2024-11-07 10:02:12,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:02:12,729 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:02:12,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:12 WrapperNode [2024-11-07 10:02:12,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:02:12,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:02:12,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:02:12,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:02:12,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:12" (1/1) ... [2024-11-07 10:02:12,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:12" (1/1) ... [2024-11-07 10:02:12,769 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-07 10:02:12,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:02:12,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:02:12,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:02:12,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:02:12,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:12" (1/1) ... [2024-11-07 10:02:12,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:12" (1/1) ... [2024-11-07 10:02:12,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:12" (1/1) ... [2024-11-07 10:02:12,796 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 10:02:12,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:12" (1/1) ... [2024-11-07 10:02:12,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:12" (1/1) ... [2024-11-07 10:02:12,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:12" (1/1) ... [2024-11-07 10:02:12,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:12" (1/1) ... [2024-11-07 10:02:12,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:12" (1/1) ... [2024-11-07 10:02:12,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:12" (1/1) ... [2024-11-07 10:02:12,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:02:12,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:02:12,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:02:12,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:02:12,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:12" (1/1) ... [2024-11-07 10:02:12,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:02:12,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:02:12,847 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 10:02:12,854 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 10:02:12,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:02:12,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:02:12,871 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:02:12,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:02:12,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:02:12,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:02:12,944 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:02:12,946 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:02:13,272 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 10:02:13,272 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:02:13,281 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:02:13,281 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:02:13,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:02:13 BoogieIcfgContainer [2024-11-07 10:02:13,282 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:02:13,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:02:13,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:02:13,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:02:13,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:02:12" (1/3) ... [2024-11-07 10:02:13,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbcecce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:02:13, skipping insertion in model container [2024-11-07 10:02:13,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:12" (2/3) ... [2024-11-07 10:02:13,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbcecce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:02:13, skipping insertion in model container [2024-11-07 10:02:13,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:02:13" (3/3) ... [2024-11-07 10:02:13,291 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-43.i [2024-11-07 10:02:13,301 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:02:13,302 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:02:13,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:02:13,356 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;@150e7569, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:02:13,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:02:13,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:02:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 10:02:13,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:02:13,371 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:13,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:02:13,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:02:13,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1571513004, now seen corresponding path program 1 times [2024-11-07 10:02:13,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:02:13,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015784437] [2024-11-07 10:02:13,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:02:13,386 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 10:02:13,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:02:13,388 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 10:02:13,391 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 10:02:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:13,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:02:13,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:02:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 10:02:13,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:02:13,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:02:13,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015784437] [2024-11-07 10:02:13,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015784437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:02:13,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:02:13,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:02:13,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126768301] [2024-11-07 10:02:13,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:02:13,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:02:13,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:02:13,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:02:13,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:02:13,778 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:02:14,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:02:14,165 INFO L93 Difference]: Finished difference Result 119 states and 198 transitions. [2024-11-07 10:02:14,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:02:14,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-11-07 10:02:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:02:14,175 INFO L225 Difference]: With dead ends: 119 [2024-11-07 10:02:14,175 INFO L226 Difference]: Without dead ends: 63 [2024-11-07 10:02:14,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:02:14,182 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 77 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:02:14,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 117 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:02:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-07 10:02:14,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2024-11-07 10:02:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:02:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2024-11-07 10:02:14,223 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 127 [2024-11-07 10:02:14,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:02:14,223 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2024-11-07 10:02:14,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:02:14,224 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2024-11-07 10:02:14,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 10:02:14,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:02:14,242 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:14,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 10:02:14,442 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 10:02:14,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:02:14,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:02:14,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1514254702, now seen corresponding path program 1 times [2024-11-07 10:02:14,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:02:14,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582315510] [2024-11-07 10:02:14,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:02:14,445 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 10:02:14,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:02:14,447 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 10:02:14,449 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 10:02:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:02:14,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 10:02:14,669 INFO L278 TraceCheckSpWp]: Computing forward predicates...