./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-53.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-53.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', '84eeb297e823eb36482e14540b5864bb912f8862fcf27c075ed8bdc65c440193'] 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-53.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 84eeb297e823eb36482e14540b5864bb912f8862fcf27c075ed8bdc65c440193 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:03:17,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:03:17,800 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:03:17,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:03:17,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:03:17,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:03:17,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:03:17,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:03:17,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:03:17,826 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:03:17,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:03:17,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:03:17,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:03:17,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:03:17,827 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:03:17,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:03:17,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:03:17,828 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:03:17,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:03:17,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:03:17,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:03:17,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:03:17,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:03:17,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:03:17,828 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:03:17,829 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:03:17,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:03:17,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:03:17,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:03:17,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:03:17,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:03:17,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:03:17,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:03:17,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:03:17,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:03:17,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:03:17,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:03:17,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:03:17,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:03:17,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:03:17,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:03:17,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:03:17,831 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 -> 84eeb297e823eb36482e14540b5864bb912f8862fcf27c075ed8bdc65c440193 [2024-11-07 10:03:18,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:03:18,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:03:18,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:03:18,111 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:03:18,111 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:03:18,113 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-53.i [2024-11-07 10:03:19,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:03:19,691 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:03:19,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-53.i [2024-11-07 10:03:19,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb5cc519d/1795fd2fba0b4ef2b4f56962c07c7395/FLAGad509335b [2024-11-07 10:03:19,721 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb5cc519d/1795fd2fba0b4ef2b4f56962c07c7395 [2024-11-07 10:03:19,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:03:19,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:03:19,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:03:19,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:03:19,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:03:19,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:03:19" (1/1) ... [2024-11-07 10:03:19,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a4d667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:19, skipping insertion in model container [2024-11-07 10:03:19,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:03:19" (1/1) ... [2024-11-07 10:03:19,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:03:19,895 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-53.i[913,926] [2024-11-07 10:03:19,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:03:19,974 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:03:19,987 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-53.i[913,926] [2024-11-07 10:03:20,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:03:20,046 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:03:20,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:20 WrapperNode [2024-11-07 10:03:20,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:03:20,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:03:20,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:03:20,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:03:20,056 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:03:20" (1/1) ... [2024-11-07 10:03:20,066 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:03:20" (1/1) ... [2024-11-07 10:03:20,116 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-11-07 10:03:20,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:03:20,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:03:20,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:03:20,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:03:20,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:20" (1/1) ... [2024-11-07 10:03:20,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:20" (1/1) ... [2024-11-07 10:03:20,132 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:20" (1/1) ... [2024-11-07 10:03:20,146 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:03:20,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:20" (1/1) ... [2024-11-07 10:03:20,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:20" (1/1) ... [2024-11-07 10:03:20,154 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:20" (1/1) ... [2024-11-07 10:03:20,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:20" (1/1) ... [2024-11-07 10:03:20,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:20" (1/1) ... [2024-11-07 10:03:20,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:20" (1/1) ... [2024-11-07 10:03:20,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:03:20,169 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:03:20,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:03:20,170 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:03:20,171 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:20" (1/1) ... [2024-11-07 10:03:20,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:03:20,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:03:20,207 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:03:20,214 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:03:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:03:20,235 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:03:20,235 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:03:20,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:03:20,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:03:20,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:03:20,317 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:03:20,319 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:03:20,597 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 10:03:20,597 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:03:20,609 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:03:20,610 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:03:20,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:03:20 BoogieIcfgContainer [2024-11-07 10:03:20,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:03:20,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:03:20,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:03:20,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:03:20,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:03:19" (1/3) ... [2024-11-07 10:03:20,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683e942c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:03:20, skipping insertion in model container [2024-11-07 10:03:20,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:20" (2/3) ... [2024-11-07 10:03:20,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683e942c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:03:20, skipping insertion in model container [2024-11-07 10:03:20,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:03:20" (3/3) ... [2024-11-07 10:03:20,624 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-53.i [2024-11-07 10:03:20,639 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:03:20,640 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:03:20,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:03:20,722 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;@3e7de6dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:03:20,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:03:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:03:20,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:03:20,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:03:20,737 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:20,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:03:20,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:03:20,742 INFO L85 PathProgramCache]: Analyzing trace with hash -678885089, now seen corresponding path program 1 times [2024-11-07 10:03:20,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:03:20,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131657988] [2024-11-07 10:03:20,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:03:20,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:03:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:20,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:03:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:20,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:03:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:20,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:03:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:20,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:03:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:20,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:03:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:20,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:03:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:21,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:03:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:21,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:03:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:21,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:03:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:21,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 10:03:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:21,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 10:03:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:21,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 10:03:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:21,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 10:03:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:21,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:03:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:21,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:03:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:21,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 10:03:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:21,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 10:03:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:21,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 10:03:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:03:21,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:03:21,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131657988] [2024-11-07 10:03:21,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131657988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:03:21,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:03:21,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:03:21,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354548727] [2024-11-07 10:03:21,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:03:21,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:03:21,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:03:21,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:03:21,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:03:21,108 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:03:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:03:21,138 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2024-11-07 10:03:21,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:03:21,141 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2024-11-07 10:03:21,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:03:21,147 INFO L225 Difference]: With dead ends: 101 [2024-11-07 10:03:21,148 INFO L226 Difference]: Without dead ends: 50 [2024-11-07 10:03:21,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:03:21,155 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:03:21,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:03:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-07 10:03:21,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-07 10:03:21,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:03:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-11-07 10:03:21,200 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 113 [2024-11-07 10:03:21,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:03:21,202 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-11-07 10:03:21,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:03:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2024-11-07 10:03:21,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:03:21,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:03:21,205 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:21,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:03:21,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:03:21,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:03:21,206 INFO L85 PathProgramCache]: Analyzing trace with hash 10989083, now seen corresponding path program 1 times [2024-11-07 10:03:21,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:03:21,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927571374] [2024-11-07 10:03:21,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:03:21,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:03:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:03:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:03:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:03:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:03:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:03:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:03:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:03:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:03:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:03:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 10:03:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 10:03:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 10:03:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 10:03:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:03:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:03:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 10:03:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 10:03:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 10:03:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 129 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2024-11-07 10:03:23,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:03:23,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927571374] [2024-11-07 10:03:23,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927571374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:03:23,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712973792] [2024-11-07 10:03:23,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:03:23,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:03:23,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:03:23,307 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:03:23,309 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:03:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:23,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-07 10:03:23,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:03:25,218 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 182 proven. 153 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-11-07 10:03:25,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:03:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 156 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-07 10:03:26,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712973792] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:03:26,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:03:26,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 15] total 38 [2024-11-07 10:03:26,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753878990] [2024-11-07 10:03:26,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:03:26,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-07 10:03:26,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:03:26,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-07 10:03:26,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1002, Unknown=0, NotChecked=0, Total=1406 [2024-11-07 10:03:26,642 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 38 states, 35 states have (on average 2.857142857142857) internal successors, (100), 33 states have internal predecessors, (100), 14 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (54), 11 states have call predecessors, (54), 14 states have call successors, (54) [2024-11-07 10:03:27,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:03:27,773 INFO L93 Difference]: Finished difference Result 188 states and 256 transitions. [2024-11-07 10:03:27,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-07 10:03:27,774 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.857142857142857) internal successors, (100), 33 states have internal predecessors, (100), 14 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (54), 11 states have call predecessors, (54), 14 states have call successors, (54) Word has length 113 [2024-11-07 10:03:27,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:03:27,777 INFO L225 Difference]: With dead ends: 188 [2024-11-07 10:03:27,778 INFO L226 Difference]: Without dead ends: 141 [2024-11-07 10:03:27,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=697, Invalid=1753, Unknown=0, NotChecked=0, Total=2450 [2024-11-07 10:03:27,782 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 275 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:03:27,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 405 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:03:27,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-07 10:03:27,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 122. [2024-11-07 10:03:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 77 states have internal predecessors, (91), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:03:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 163 transitions. [2024-11-07 10:03:27,810 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 163 transitions. Word has length 113 [2024-11-07 10:03:27,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:03:27,810 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 163 transitions. [2024-11-07 10:03:27,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.857142857142857) internal successors, (100), 33 states have internal predecessors, (100), 14 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (54), 11 states have call predecessors, (54), 14 states have call successors, (54) [2024-11-07 10:03:27,811 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 163 transitions. [2024-11-07 10:03:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 10:03:27,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:03:27,813 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:27,834 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:03:28,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:03:28,018 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:03:28,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:03:28,019 INFO L85 PathProgramCache]: Analyzing trace with hash -236601490, now seen corresponding path program 1 times [2024-11-07 10:03:28,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:03:28,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467811925] [2024-11-07 10:03:28,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:03:28,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:03:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:03:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:03:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:03:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:03:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:03:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:03:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:03:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:03:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:03:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 10:03:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 10:03:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 10:03:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 10:03:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:03:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:03:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 10:03:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 10:03:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 10:03:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 120 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-11-07 10:03:28,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:03:28,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467811925] [2024-11-07 10:03:28,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467811925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:03:28,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893856179] [2024-11-07 10:03:28,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:03:28,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:03:28,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:03:28,696 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:03:28,697 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:03:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:28,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-07 10:03:28,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:03:29,810 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 388 proven. 141 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-07 10:03:29,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:03:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 75 proven. 111 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-07 10:03:35,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893856179] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:03:35,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:03:35,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 14] total 31 [2024-11-07 10:03:35,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371740350] [2024-11-07 10:03:35,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:03:35,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-07 10:03:35,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:03:35,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-07 10:03:35,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=674, Unknown=1, NotChecked=0, Total=930 [2024-11-07 10:03:35,420 INFO L87 Difference]: Start difference. First operand 122 states and 163 transitions. Second operand has 31 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 28 states have internal predecessors, (82), 12 states have call successors, (48), 6 states have call predecessors, (48), 13 states have return successors, (49), 12 states have call predecessors, (49), 12 states have call successors, (49) [2024-11-07 10:03:39,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 10:03:43,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 10:03:44,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:03:44,624 INFO L93 Difference]: Finished difference Result 275 states and 344 transitions. [2024-11-07 10:03:44,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-07 10:03:44,625 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 28 states have internal predecessors, (82), 12 states have call successors, (48), 6 states have call predecessors, (48), 13 states have return successors, (49), 12 states have call predecessors, (49), 12 states have call successors, (49) Word has length 114 [2024-11-07 10:03:44,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:03:44,627 INFO L225 Difference]: With dead ends: 275 [2024-11-07 10:03:44,627 INFO L226 Difference]: Without dead ends: 156 [2024-11-07 10:03:44,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=511, Invalid=1210, Unknown=1, NotChecked=0, Total=1722 [2024-11-07 10:03:44,632 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 76 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 46 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:03:44,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 192 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 394 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2024-11-07 10:03:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-07 10:03:44,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2024-11-07 10:03:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 91 states have (on average 1.0769230769230769) internal successors, (98), 91 states have internal predecessors, (98), 36 states have call successors, (36), 16 states have call predecessors, (36), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:03:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 170 transitions. [2024-11-07 10:03:44,671 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 170 transitions. Word has length 114 [2024-11-07 10:03:44,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:03:44,671 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 170 transitions. [2024-11-07 10:03:44,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 28 states have internal predecessors, (82), 12 states have call successors, (48), 6 states have call predecessors, (48), 13 states have return successors, (49), 12 states have call predecessors, (49), 12 states have call successors, (49) [2024-11-07 10:03:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 170 transitions. [2024-11-07 10:03:44,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 10:03:44,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:03:44,673 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:44,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 10:03:44,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:03:44,874 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:03:44,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:03:44,874 INFO L85 PathProgramCache]: Analyzing trace with hash -916659860, now seen corresponding path program 1 times [2024-11-07 10:03:44,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:03:44,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767901781] [2024-11-07 10:03:44,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:03:44,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:03:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:03:44,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:03:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:03:45,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:03:45,073 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:03:45,075 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:03:45,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:03:45,080 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 10:03:45,177 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:03:45,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:03:45 BoogieIcfgContainer [2024-11-07 10:03:45,187 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:03:45,188 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:03:45,188 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:03:45,188 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:03:45,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:03:20" (3/4) ... [2024-11-07 10:03:45,191 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:03:45,191 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:03:45,192 INFO L158 Benchmark]: Toolchain (without parser) took 25466.20ms. Allocated memory was 100.7MB in the beginning and 192.9MB in the end (delta: 92.3MB). Free memory was 77.3MB in the beginning and 130.7MB in the end (delta: -53.4MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2024-11-07 10:03:45,192 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:03:45,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.81ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 64.2MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:03:45,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.15ms. Allocated memory is still 100.7MB. Free memory was 64.2MB in the beginning and 61.9MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:03:45,193 INFO L158 Benchmark]: Boogie Preprocessor took 50.98ms. Allocated memory is still 100.7MB. Free memory was 61.9MB in the beginning and 58.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:03:45,193 INFO L158 Benchmark]: RCFGBuilder took 441.11ms. Allocated memory is still 100.7MB. Free memory was 58.8MB in the beginning and 42.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:03:45,193 INFO L158 Benchmark]: TraceAbstraction took 24573.96ms. Allocated memory was 100.7MB in the beginning and 192.9MB in the end (delta: 92.3MB). Free memory was 42.3MB in the beginning and 130.7MB in the end (delta: -88.4MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-11-07 10:03:45,193 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 192.9MB. Free memory was 130.7MB in the beginning and 130.7MB in the end (delta: 29.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:03:45,194 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.27ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.81ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 64.2MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.15ms. Allocated memory is still 100.7MB. Free memory was 64.2MB in the beginning and 61.9MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.98ms. Allocated memory is still 100.7MB. Free memory was 61.9MB in the beginning and 58.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 441.11ms. Allocated memory is still 100.7MB. Free memory was 58.8MB in the beginning and 42.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24573.96ms. Allocated memory was 100.7MB in the beginning and 192.9MB in the end (delta: 92.3MB). Free memory was 42.3MB in the beginning and 130.7MB in the end (delta: -88.4MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 192.9MB. Free memory was 130.7MB in the beginning and 130.7MB in the end (delta: 29.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_3 = 1456677701; [L24] unsigned long int var_1_4 = 1000000000; [L25] unsigned long int var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 0; [L29] double var_1_9 = 256.5; [L30] double var_1_10 = 8.8; [L31] unsigned char var_1_11 = 1; [L32] unsigned short int var_1_12 = 16; [L33] unsigned long int var_1_13 = 3110219175; [L34] unsigned short int var_1_14 = 128; [L35] unsigned char var_1_15 = 1; [L36] unsigned char var_1_16 = 0; VAL [isInitial=0, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] FCALL updateLastVariables() [L107] CALL updateVariables() [L67] var_1_3 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_3 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L68] RET assume_abort_if_not(var_1_3 >= 1073741823) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L69] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L69] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L70] var_1_4 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_4 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L71] RET assume_abort_if_not(var_1_4 >= 536870911) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L72] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L72] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L73] var_1_5 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L74] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L75] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L75] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L76] var_1_7 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=513/2] [L77] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=513/2] [L78] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=513/2] [L78] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=513/2] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L80] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L82] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L83] var_1_11 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L84] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L85] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L86] var_1_13 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L87] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L88] CALL assume_abort_if_not(var_1_13 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L88] RET assume_abort_if_not(var_1_13 <= 4294967295) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L89] var_1_14 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L90] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L91] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L91] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L92] var_1_16 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L93] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L94] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L94] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L107] RET updateVariables() [L108] CALL step() [L40] var_1_6 = var_1_7 VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L41] COND TRUE var_1_5 <= (var_1_13 - var_1_4) [L42] var_1_12 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, var_1_11=1, var_1_12=0, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L44] COND TRUE (var_1_9 * 16.5f) > var_1_10 [L45] var_1_15 = (! var_1_11) VAL [isInitial=1, var_1_11=1, var_1_12=0, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=0, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L49] var_1_1 = (var_1_12 + (var_1_3 - (var_1_4 - var_1_12))) [L50] signed long int stepLocal_1 = (((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)); [L51] unsigned long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=1073741823, stepLocal_1=0, var_1_11=1, var_1_12=0, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=0, var_1_16=1, var_1_1=-4294967296, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L52] COND TRUE stepLocal_1 != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3))) VAL [isInitial=1, stepLocal_0=1073741823, var_1_11=1, var_1_12=0, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=0, var_1_16=1, var_1_1=-4294967296, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L53] COND FALSE !(var_1_9 == var_1_10) VAL [isInitial=1, stepLocal_0=1073741823, var_1_11=1, var_1_12=0, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=0, var_1_16=1, var_1_1=-4294967296, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L108] RET step() [L109] CALL, EXPR property() [L99-L100] return ((((var_1_1 == ((unsigned long int) (var_1_12 + (var_1_3 - (var_1_4 - var_1_12))))) && (var_1_6 == ((unsigned char) var_1_7))) && ((((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12))) != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)))) ? ((var_1_9 == var_1_10) ? (var_1_6 ? ((var_1_3 >= var_1_12) ? (var_1_8 == ((unsigned char) (var_1_7 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_7))) : 1) : 1) : (var_1_8 == ((unsigned char) var_1_11)))) && ((var_1_5 <= (var_1_13 - var_1_4)) ? (var_1_12 == ((unsigned short int) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))) : 1)) && (((var_1_9 * 16.5f) > var_1_10) ? (var_1_15 == ((unsigned char) (! var_1_11))) : (var_1_15 == ((unsigned char) (var_1_11 && var_1_16)))) ; VAL [\result=0, isInitial=1, var_1_11=1, var_1_12=0, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=0, var_1_16=1, var_1_1=-4294967296, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=1, var_1_12=0, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=0, var_1_16=1, var_1_1=-4294967296, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_11=1, var_1_12=0, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=0, var_1_16=1, var_1_1=-4294967296, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.4s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 361 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 351 mSDsluCounter, 670 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 500 mSDsCounter, 223 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1048 IncrementalHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 223 mSolverCounterUnsat, 170 mSDtfsCounter, 1048 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 626 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=3, InterpolantAutomatonStates: 60, 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, 3 MinimizatonAttempts, 31 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 681 NumberOfCodeBlocks, 681 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 7457 SizeOfPredicates, 14 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 3474/4284 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:03:45,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-53.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 84eeb297e823eb36482e14540b5864bb912f8862fcf27c075ed8bdc65c440193 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:03:47,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:03:47,523 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:03:47,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:03:47,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:03:47,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:03:47,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:03:47,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:03:47,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:03:47,551 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:03:47,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:03:47,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:03:47,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:03:47,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:03:47,552 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:03:47,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:03:47,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:03:47,552 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:03:47,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:03:47,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:03:47,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:03:47,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:03:47,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:03:47,552 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:03:47,553 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:03:47,553 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:03:47,553 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:03:47,553 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:03:47,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:03:47,553 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:03:47,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:03:47,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:03:47,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:03:47,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:03:47,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:03:47,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:03:47,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:03:47,554 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:03:47,554 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:03:47,554 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:03:47,554 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:03:47,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:03:47,554 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:03:47,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:03:47,555 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 -> 84eeb297e823eb36482e14540b5864bb912f8862fcf27c075ed8bdc65c440193 [2024-11-07 10:03:47,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:03:47,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:03:47,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:03:47,896 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:03:47,897 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:03:47,899 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-53.i [2024-11-07 10:03:49,210 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:03:49,462 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:03:49,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-53.i [2024-11-07 10:03:49,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c309a3c15/92b07214f212445fa24357aeec156bac/FLAG8fa52a348 [2024-11-07 10:03:49,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c309a3c15/92b07214f212445fa24357aeec156bac [2024-11-07 10:03:49,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:03:49,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:03:49,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:03:49,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:03:49,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:03:49,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:03:49" (1/1) ... [2024-11-07 10:03:49,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b2a36f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:49, skipping insertion in model container [2024-11-07 10:03:49,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:03:49" (1/1) ... [2024-11-07 10:03:49,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:03:49,656 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-53.i[913,926] [2024-11-07 10:03:49,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:03:49,726 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:03:49,740 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-53.i[913,926] [2024-11-07 10:03:49,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:03:49,786 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:03:49,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:49 WrapperNode [2024-11-07 10:03:49,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:03:49,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:03:49,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:03:49,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:03:49,797 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:03:49" (1/1) ... [2024-11-07 10:03:49,812 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:03:49" (1/1) ... [2024-11-07 10:03:49,841 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-11-07 10:03:49,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:03:49,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:03:49,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:03:49,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:03:49,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:49" (1/1) ... [2024-11-07 10:03:49,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:49" (1/1) ... [2024-11-07 10:03:49,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:49" (1/1) ... [2024-11-07 10:03:49,876 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:03:49,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:49" (1/1) ... [2024-11-07 10:03:49,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:49" (1/1) ... [2024-11-07 10:03:49,886 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:49" (1/1) ... [2024-11-07 10:03:49,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:49" (1/1) ... [2024-11-07 10:03:49,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:49" (1/1) ... [2024-11-07 10:03:49,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:49" (1/1) ... [2024-11-07 10:03:49,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:03:49,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:03:49,911 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:03:49,911 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:03:49,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:49" (1/1) ... [2024-11-07 10:03:49,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:03:49,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:03:49,944 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:03:49,951 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:03:49,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:03:49,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:03:49,970 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:03:49,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:03:49,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:03:49,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:03:50,038 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:03:50,040 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:03:50,421 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 10:03:50,422 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:03:50,433 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:03:50,435 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:03:50,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:03:50 BoogieIcfgContainer [2024-11-07 10:03:50,435 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:03:50,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:03:50,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:03:50,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:03:50,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:03:49" (1/3) ... [2024-11-07 10:03:50,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285d5c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:03:50, skipping insertion in model container [2024-11-07 10:03:50,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:49" (2/3) ... [2024-11-07 10:03:50,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285d5c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:03:50, skipping insertion in model container [2024-11-07 10:03:50,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:03:50" (3/3) ... [2024-11-07 10:03:50,448 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-53.i [2024-11-07 10:03:50,463 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:03:50,463 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:03:50,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:03:50,539 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;@5bcefa62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:03:50,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:03:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:03:50,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:03:50,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:03:50,570 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:50,571 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:03:50,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:03:50,575 INFO L85 PathProgramCache]: Analyzing trace with hash -678885089, now seen corresponding path program 1 times [2024-11-07 10:03:50,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:03:50,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302740056] [2024-11-07 10:03:50,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:03:50,583 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:03:50,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:03:50,586 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:03:50,589 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:03:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:50,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:03:50,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:03:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-07 10:03:50,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:03:50,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:03:50,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302740056] [2024-11-07 10:03:50,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302740056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:03:50,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:03:50,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:03:50,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260993010] [2024-11-07 10:03:50,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:03:50,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:03:50,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:03:50,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:03:50,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:03:50,884 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:03:50,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:03:50,903 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2024-11-07 10:03:50,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:03:50,905 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2024-11-07 10:03:50,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:03:50,910 INFO L225 Difference]: With dead ends: 101 [2024-11-07 10:03:50,910 INFO L226 Difference]: Without dead ends: 50 [2024-11-07 10:03:50,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:03:50,917 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:03:50,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:03:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-07 10:03:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-07 10:03:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:03:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-11-07 10:03:50,956 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 113 [2024-11-07 10:03:50,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:03:50,957 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-11-07 10:03:50,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:03:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2024-11-07 10:03:50,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:03:50,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:03:50,962 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:50,972 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:03:51,162 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:03:51,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:03:51,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:03:51,164 INFO L85 PathProgramCache]: Analyzing trace with hash 10989083, now seen corresponding path program 1 times [2024-11-07 10:03:51,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:03:51,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495943048] [2024-11-07 10:03:51,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:03:51,165 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:03:51,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:03:51,168 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:03:51,169 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:03:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:51,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 10:03:51,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:03:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 80 proven. 168 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:03:52,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:03:52,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:03:52,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495943048] [2024-11-07 10:03:52,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495943048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:03:52,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1271110816] [2024-11-07 10:03:52,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:03:52,990 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:03:52,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:03:52,994 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 10:03:52,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-07 10:03:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:03:53,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 10:03:53,388 INFO L278 TraceCheckSpWp]: Computing forward predicates...