./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-15.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-15.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', 'f973169401bb1753394cb63d2104eadaf253c35457ff559a70aef9da15f26905'] 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-15.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 f973169401bb1753394cb63d2104eadaf253c35457ff559a70aef9da15f26905 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:58:30,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:58:30,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 09:58:30,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:58:30,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:58:30,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:58:30,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:58:30,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:58:30,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:58:30,399 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:58:30,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:58:30,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:58:30,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:58:30,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:58:30,400 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:58:30,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:58:30,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:58:30,401 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:58:30,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:58:30,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:58:30,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:58:30,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:58:30,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:58:30,401 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:58:30,401 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:58:30,402 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:58:30,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:58:30,402 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:58:30,402 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:58:30,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:58:30,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:58:30,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:58:30,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:58:30,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:58:30,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:58:30,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:58:30,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:58:30,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:58:30,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:58:30,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:58:30,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:58:30,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:58:30,404 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 -> f973169401bb1753394cb63d2104eadaf253c35457ff559a70aef9da15f26905 [2024-11-07 09:58:30,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:58:30,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:58:30,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:58:30,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:58:30,676 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:58:30,676 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-15.i [2024-11-07 09:58:31,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:58:32,085 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:58:32,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-15.i [2024-11-07 09:58:32,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5b28213b/c13405ec348f43ad8b9a9a92b1cbb397/FLAG5ee9b825a [2024-11-07 09:58:32,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5b28213b/c13405ec348f43ad8b9a9a92b1cbb397 [2024-11-07 09:58:32,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:58:32,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:58:32,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:58:32,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:58:32,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:58:32,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:58:32" (1/1) ... [2024-11-07 09:58:32,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1c9810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:32, skipping insertion in model container [2024-11-07 09:58:32,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:58:32" (1/1) ... [2024-11-07 09:58:32,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:58:32,557 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-15.i[913,926] [2024-11-07 09:58:32,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:58:32,597 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:58:32,605 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-15.i[913,926] [2024-11-07 09:58:32,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:58:32,628 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:58:32,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:32 WrapperNode [2024-11-07 09:58:32,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:58:32,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:58:32,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:58:32,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:58:32,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:32" (1/1) ... [2024-11-07 09:58:32,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:32" (1/1) ... [2024-11-07 09:58:32,653 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-11-07 09:58:32,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:58:32,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:58:32,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:58:32,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:58:32,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:32" (1/1) ... [2024-11-07 09:58:32,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:32" (1/1) ... [2024-11-07 09:58:32,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:32" (1/1) ... [2024-11-07 09:58:32,670 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 09:58:32,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:32" (1/1) ... [2024-11-07 09:58:32,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:32" (1/1) ... [2024-11-07 09:58:32,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:32" (1/1) ... [2024-11-07 09:58:32,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:32" (1/1) ... [2024-11-07 09:58:32,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:32" (1/1) ... [2024-11-07 09:58:32,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:32" (1/1) ... [2024-11-07 09:58:32,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:58:32,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:58:32,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:58:32,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:58:32,685 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:32" (1/1) ... [2024-11-07 09:58:32,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:58:32,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:58:32,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 09:58:32,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 09:58:32,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:58:32,736 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:58:32,736 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:58:32,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:58:32,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:58:32,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:58:32,798 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:58:32,799 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:58:33,005 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 09:58:33,005 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:58:33,013 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:58:33,014 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:58:33,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:58:33 BoogieIcfgContainer [2024-11-07 09:58:33,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:58:33,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:58:33,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:58:33,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:58:33,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:58:32" (1/3) ... [2024-11-07 09:58:33,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d6432a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:58:33, skipping insertion in model container [2024-11-07 09:58:33,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:32" (2/3) ... [2024-11-07 09:58:33,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d6432a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:58:33, skipping insertion in model container [2024-11-07 09:58:33,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:58:33" (3/3) ... [2024-11-07 09:58:33,025 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-15.i [2024-11-07 09:58:33,037 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:58:33,037 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:58:33,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:58:33,098 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;@32da450c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:58:33,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:58:33,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 09:58:33,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 09:58:33,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:58:33,112 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:58:33,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:58:33,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:58:33,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1601258831, now seen corresponding path program 1 times [2024-11-07 09:58:33,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:58:33,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537797985] [2024-11-07 09:58:33,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:58:33,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:58:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:33,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:58:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:33,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:58:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:33,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:58:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:33,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:58:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:33,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:58:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:33,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:58:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:33,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:58:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:33,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:58:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:33,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:58:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:33,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 09:58:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:33,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 09:58:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:33,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 09:58:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 09:58:33,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:58:33,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537797985] [2024-11-07 09:58:33,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537797985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:58:33,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:58:33,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:58:33,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915810941] [2024-11-07 09:58:33,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:58:33,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:58:33,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:58:33,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:58:33,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:58:33,426 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 09:58:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:58:33,445 INFO L93 Difference]: Finished difference Result 85 states and 138 transitions. [2024-11-07 09:58:33,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:58:33,447 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2024-11-07 09:58:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:58:33,452 INFO L225 Difference]: With dead ends: 85 [2024-11-07 09:58:33,453 INFO L226 Difference]: Without dead ends: 42 [2024-11-07 09:58:33,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:58:33,458 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:58:33,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:58:33,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-07 09:58:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-07 09:58:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 09:58:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-11-07 09:58:33,492 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 82 [2024-11-07 09:58:33,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:58:33,492 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-11-07 09:58:33,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 09:58:33,493 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2024-11-07 09:58:33,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 09:58:33,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:58:33,495 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:58:33,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:58:33,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:58:33,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:58:33,496 INFO L85 PathProgramCache]: Analyzing trace with hash 109782457, now seen corresponding path program 1 times [2024-11-07 09:58:33,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:58:33,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415425760] [2024-11-07 09:58:33,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:58:33,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:58:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:33,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:58:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:33,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:58:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:33,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:58:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:58:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:58:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:58:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:58:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:58:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:58:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 09:58:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 09:58:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 09:58:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 09:58:34,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:58:34,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415425760] [2024-11-07 09:58:34,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415425760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:58:34,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:58:34,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 09:58:34,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396310935] [2024-11-07 09:58:34,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:58:34,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 09:58:34,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:58:34,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 09:58:34,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 09:58:34,042 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 09:58:34,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:58:34,078 INFO L93 Difference]: Finished difference Result 95 states and 131 transitions. [2024-11-07 09:58:34,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 09:58:34,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-11-07 09:58:34,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:58:34,081 INFO L225 Difference]: With dead ends: 95 [2024-11-07 09:58:34,082 INFO L226 Difference]: Without dead ends: 56 [2024-11-07 09:58:34,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 09:58:34,083 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:58:34,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 121 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:58:34,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-07 09:58:34,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2024-11-07 09:58:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 09:58:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2024-11-07 09:58:34,091 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 82 [2024-11-07 09:58:34,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:58:34,092 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2024-11-07 09:58:34,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 09:58:34,092 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2024-11-07 09:58:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 09:58:34,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:58:34,093 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:58:34,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:58:34,093 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:58:34,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:58:34,093 INFO L85 PathProgramCache]: Analyzing trace with hash -19505799, now seen corresponding path program 1 times [2024-11-07 09:58:34,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:58:34,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421207329] [2024-11-07 09:58:34,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:58:34,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:58:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:58:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:58:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:58:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:58:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:58:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:58:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:58:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:58:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:58:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 09:58:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 09:58:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 09:58:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 09:58:34,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:58:34,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421207329] [2024-11-07 09:58:34,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421207329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:58:34,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:58:34,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 09:58:34,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663540715] [2024-11-07 09:58:34,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:58:34,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 09:58:34,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:58:34,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 09:58:34,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:58:34,250 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 09:58:34,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:58:34,269 INFO L93 Difference]: Finished difference Result 127 states and 175 transitions. [2024-11-07 09:58:34,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:58:34,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-11-07 09:58:34,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:58:34,271 INFO L225 Difference]: With dead ends: 127 [2024-11-07 09:58:34,271 INFO L226 Difference]: Without dead ends: 85 [2024-11-07 09:58:34,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:58:34,272 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:58:34,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 116 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:58:34,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-07 09:58:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-07 09:58:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 09:58:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2024-11-07 09:58:34,288 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 82 [2024-11-07 09:58:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:58:34,289 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2024-11-07 09:58:34,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 09:58:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2024-11-07 09:58:34,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 09:58:34,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:58:34,291 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:58:34,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 09:58:34,292 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:58:34,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:58:34,292 INFO L85 PathProgramCache]: Analyzing trace with hash -636021362, now seen corresponding path program 1 times [2024-11-07 09:58:34,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:58:34,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135532295] [2024-11-07 09:58:34,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:58:34,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:58:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:58:34,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 09:58:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:58:34,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 09:58:34,515 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 09:58:34,516 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:58:34,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 09:58:34,520 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 09:58:34,568 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:58:34,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:58:34 BoogieIcfgContainer [2024-11-07 09:58:34,570 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:58:34,571 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:58:34,571 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:58:34,571 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:58:34,571 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:58:33" (3/4) ... [2024-11-07 09:58:34,573 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 09:58:34,573 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:58:34,574 INFO L158 Benchmark]: Toolchain (without parser) took 2143.53ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 91.2MB in the beginning and 120.3MB in the end (delta: -29.1MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2024-11-07 09:58:34,574 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:58:34,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.99ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 78.6MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:58:34,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.80ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 77.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:58:34,575 INFO L158 Benchmark]: Boogie Preprocessor took 26.16ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 75.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:58:34,575 INFO L158 Benchmark]: RCFGBuilder took 333.69ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 61.7MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:58:34,575 INFO L158 Benchmark]: TraceAbstraction took 1553.69ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 61.1MB in the beginning and 121.2MB in the end (delta: -60.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:58:34,575 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 120.3MB in the end (delta: 954.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:58:34,576 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.75ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.99ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 78.6MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.80ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 77.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.16ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 75.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 333.69ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 61.7MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1553.69ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 61.1MB in the beginning and 121.2MB in the end (delta: -60.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 120.3MB in the end (delta: 954.5kB). 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 91, overapproximation of someBinaryArithmeticDOUBLEoperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -128; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_7 = 8; [L26] unsigned long int var_1_8 = 1; [L27] unsigned long int var_1_9 = 1885310857; [L28] signed long int var_1_10 = -10; [L29] double var_1_11 = 32.6; [L30] double var_1_12 = 9.75; [L31] double var_1_13 = 5.1; [L32] double var_1_14 = 128.1; [L33] double var_1_15 = 63.9; [L34] signed long int last_1_var_1_10 = -10; VAL [isInitial=0, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] CALL updateLastVariables() [L88] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L67] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L68] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L68] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L72] var_1_7 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L73] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L74] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L74] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L75] var_1_9 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_9 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L76] RET assume_abort_if_not(var_1_9 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L77] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L77] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L78] var_1_12 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L79] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L80] var_1_13 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L81] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L82] var_1_14 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L83] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L84] var_1_15 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L85] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L99] RET updateVariables() [L100] CALL step() [L38] COND TRUE \read(var_1_2) [L39] var_1_8 = ((1514707036u + ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))) - last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L43] COND TRUE \read(var_1_2) [L44] var_1_10 = (var_1_8 + ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-1706518424, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L46] unsigned char stepLocal_1 = var_1_2; [L47] signed long int stepLocal_0 = var_1_10; VAL [isInitial=1, last_1_var_1_10=-10, stepLocal_0=-1706518424, stepLocal_1=-255, var_1_10=-1706518424, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L48] COND TRUE stepLocal_1 || ((~ var_1_10) >= var_1_10) VAL [isInitial=1, last_1_var_1_10=-10, stepLocal_0=-1706518424, var_1_10=-1706518424, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L49] COND FALSE !(stepLocal_0 < var_1_8) [L54] var_1_1 = 2 VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-1706518424, var_1_11=163/5, var_1_1=2, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L59] COND TRUE var_1_1 >= var_1_1 [L60] var_1_11 = (var_1_12 - (((((var_1_13 + var_1_14)) > (var_1_15)) ? ((var_1_13 + var_1_14)) : (var_1_15)))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-1706518424, var_1_1=2, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L100] RET step() [L101] CALL, EXPR property() [L91-L92] return ((((var_1_2 || ((~ var_1_10) >= var_1_10)) ? ((var_1_10 < var_1_8) ? ((! var_1_6) ? (var_1_1 == ((signed char) var_1_7)) : 1) : (var_1_1 == ((signed char) 2))) : (var_1_1 == ((signed char) var_1_7))) && (var_1_2 ? (var_1_8 == ((unsigned long int) ((1514707036u + ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))) - last_1_var_1_10))) : (var_1_8 == ((unsigned long int) ((((last_1_var_1_10) > (var_1_9)) ? (last_1_var_1_10) : (var_1_9))))))) && (var_1_2 ? (var_1_10 == ((signed long int) (var_1_8 + ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))))) : 1)) && ((var_1_1 >= var_1_1) ? (var_1_11 == ((double) (var_1_12 - (((((var_1_13 + var_1_14)) > (var_1_15)) ? ((var_1_13 + var_1_14)) : (var_1_15)))))) : (var_1_11 == ((double) ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13)))))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=-10, var_1_10=-1706518424, var_1_1=2, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-1706518424, var_1_1=2, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-1706518424, var_1_1=2, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 295 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 109 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 186 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 380 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 792/792 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 09:58:34,602 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-15.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 f973169401bb1753394cb63d2104eadaf253c35457ff559a70aef9da15f26905 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:58:36,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:58:36,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 09:58:36,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:58:36,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:58:36,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:58:36,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:58:36,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:58:36,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:58:36,558 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:58:36,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:58:36,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:58:36,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:58:36,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:58:36,559 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:58:36,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:58:36,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:58:36,560 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:58:36,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:58:36,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:58:36,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:58:36,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:58:36,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:58:36,561 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 09:58:36,561 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 09:58:36,561 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:58:36,561 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 09:58:36,561 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:58:36,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:58:36,561 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:58:36,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:58:36,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:58:36,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:58:36,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:58:36,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:58:36,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:58:36,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:58:36,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:58:36,562 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 09:58:36,562 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 09:58:36,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:58:36,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:58:36,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:58:36,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:58:36,562 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 -> f973169401bb1753394cb63d2104eadaf253c35457ff559a70aef9da15f26905 [2024-11-07 09:58:36,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:58:36,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:58:36,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:58:36,808 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:58:36,808 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:58:36,810 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-15.i [2024-11-07 09:58:38,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:58:38,202 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:58:38,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-15.i [2024-11-07 09:58:38,211 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/423456d88/bd6b80c0a11044238795a7731b486949/FLAG1128fbc2d [2024-11-07 09:58:38,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/423456d88/bd6b80c0a11044238795a7731b486949 [2024-11-07 09:58:38,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:58:38,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:58:38,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:58:38,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:58:38,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:58:38,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:58:38" (1/1) ... [2024-11-07 09:58:38,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@571a018a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:38, skipping insertion in model container [2024-11-07 09:58:38,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:58:38" (1/1) ... [2024-11-07 09:58:38,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:58:38,358 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-15.i[913,926] [2024-11-07 09:58:38,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:58:38,415 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:58:38,425 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-15.i[913,926] [2024-11-07 09:58:38,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:58:38,467 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:58:38,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:38 WrapperNode [2024-11-07 09:58:38,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:58:38,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:58:38,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:58:38,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:58:38,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:38" (1/1) ... [2024-11-07 09:58:38,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:38" (1/1) ... [2024-11-07 09:58:38,508 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-11-07 09:58:38,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:58:38,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:58:38,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:58:38,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:58:38,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:38" (1/1) ... [2024-11-07 09:58:38,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:38" (1/1) ... [2024-11-07 09:58:38,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:38" (1/1) ... [2024-11-07 09:58:38,538 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 09:58:38,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:38" (1/1) ... [2024-11-07 09:58:38,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:38" (1/1) ... [2024-11-07 09:58:38,551 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:38" (1/1) ... [2024-11-07 09:58:38,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:38" (1/1) ... [2024-11-07 09:58:38,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:38" (1/1) ... [2024-11-07 09:58:38,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:38" (1/1) ... [2024-11-07 09:58:38,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:58:38,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:58:38,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:58:38,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:58:38,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:38" (1/1) ... [2024-11-07 09:58:38,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:58:38,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:58:38,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 09:58:38,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 09:58:38,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:58:38,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 09:58:38,622 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:58:38,622 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:58:38,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:58:38,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:58:38,696 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:58:38,697 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:58:40,539 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 09:58:40,540 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:58:40,549 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:58:40,549 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:58:40,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:58:40 BoogieIcfgContainer [2024-11-07 09:58:40,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:58:40,554 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:58:40,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:58:40,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:58:40,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:58:38" (1/3) ... [2024-11-07 09:58:40,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52faf8fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:58:40, skipping insertion in model container [2024-11-07 09:58:40,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:38" (2/3) ... [2024-11-07 09:58:40,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52faf8fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:58:40, skipping insertion in model container [2024-11-07 09:58:40,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:58:40" (3/3) ... [2024-11-07 09:58:40,561 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-15.i [2024-11-07 09:58:40,573 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:58:40,573 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:58:40,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:58:40,631 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;@6f7d1eee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:58:40,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:58:40,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 09:58:40,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 09:58:40,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:58:40,643 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:58:40,644 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:58:40,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:58:40,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1601258831, now seen corresponding path program 1 times [2024-11-07 09:58:40,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:58:40,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107189951] [2024-11-07 09:58:40,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:58:40,660 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 09:58:40,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:58:40,664 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 09:58:40,684 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 09:58:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:40,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 09:58:40,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:58:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-07 09:58:40,940 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:58:40,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:58:40,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107189951] [2024-11-07 09:58:40,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107189951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:58:40,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:58:40,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:58:40,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459938715] [2024-11-07 09:58:40,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:58:40,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:58:40,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:58:40,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:58:40,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:58:40,962 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 09:58:40,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:58:40,975 INFO L93 Difference]: Finished difference Result 85 states and 138 transitions. [2024-11-07 09:58:40,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:58:40,976 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2024-11-07 09:58:40,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:58:40,980 INFO L225 Difference]: With dead ends: 85 [2024-11-07 09:58:40,980 INFO L226 Difference]: Without dead ends: 42 [2024-11-07 09:58:40,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:58:40,983 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:58:40,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:58:40,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-07 09:58:41,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-07 09:58:41,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 09:58:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-11-07 09:58:41,008 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 82 [2024-11-07 09:58:41,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:58:41,009 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-11-07 09:58:41,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 09:58:41,009 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2024-11-07 09:58:41,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 09:58:41,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:58:41,012 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:58:41,021 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 09:58:41,213 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 09:58:41,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:58:41,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:58:41,215 INFO L85 PathProgramCache]: Analyzing trace with hash 109782457, now seen corresponding path program 1 times [2024-11-07 09:58:41,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:58:41,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625908621] [2024-11-07 09:58:41,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:58:41,215 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 09:58:41,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:58:41,218 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 09:58:41,218 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 09:58:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:41,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 09:58:41,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:58:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-07 09:58:41,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 09:58:41,804 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 09:58:41,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:58:41,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625908621] [2024-11-07 09:58:41,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625908621] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 09:58:41,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 09:58:41,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-07 09:58:41,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474068469] [2024-11-07 09:58:41,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:58:41,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 09:58:41,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:58:41,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 09:58:41,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:58:41,809 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 09:58:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:58:42,408 INFO L93 Difference]: Finished difference Result 95 states and 131 transitions. [2024-11-07 09:58:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 09:58:42,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-11-07 09:58:42,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:58:42,422 INFO L225 Difference]: With dead ends: 95 [2024-11-07 09:58:42,422 INFO L226 Difference]: Without dead ends: 56 [2024-11-07 09:58:42,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:58:42,423 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 16 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 09:58:42,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 165 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 09:58:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-07 09:58:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2024-11-07 09:58:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 09:58:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2024-11-07 09:58:42,429 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 82 [2024-11-07 09:58:42,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:58:42,429 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2024-11-07 09:58:42,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 09:58:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2024-11-07 09:58:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 09:58:42,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:58:42,431 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:58:42,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 09:58:42,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 09:58:42,632 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:58:42,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:58:42,632 INFO L85 PathProgramCache]: Analyzing trace with hash -19505799, now seen corresponding path program 1 times [2024-11-07 09:58:42,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:58:42,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350986431] [2024-11-07 09:58:42,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:58:42,633 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 09:58:42,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:58:42,635 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 09:58:42,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 09:58:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:42,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 09:58:42,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:58:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 09:58:43,053 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:58:43,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:58:43,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350986431] [2024-11-07 09:58:43,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1350986431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:58:43,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:58:43,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:58:43,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304262835] [2024-11-07 09:58:43,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:58:43,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 09:58:43,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:58:43,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 09:58:43,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:58:43,057 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 09:58:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:58:43,424 INFO L93 Difference]: Finished difference Result 127 states and 175 transitions. [2024-11-07 09:58:43,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:58:43,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-11-07 09:58:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:58:43,425 INFO L225 Difference]: With dead ends: 127 [2024-11-07 09:58:43,426 INFO L226 Difference]: Without dead ends: 85 [2024-11-07 09:58:43,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:58:43,426 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 13 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 09:58:43,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 116 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 09:58:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-07 09:58:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-07 09:58:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 09:58:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2024-11-07 09:58:43,438 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 82 [2024-11-07 09:58:43,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:58:43,438 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2024-11-07 09:58:43,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 09:58:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2024-11-07 09:58:43,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 09:58:43,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:58:43,440 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:58:43,449 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 (4)] Ended with exit code 0 [2024-11-07 09:58:43,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 09:58:43,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:58:43,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:58:43,641 INFO L85 PathProgramCache]: Analyzing trace with hash -636021362, now seen corresponding path program 1 times [2024-11-07 09:58:43,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:58:43,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670484840] [2024-11-07 09:58:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:58:43,642 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 09:58:43,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:58:43,644 INFO L229 MonitoredProcess]: Starting monitored process 5 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 09:58:43,646 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 (5)] Waiting until timeout for monitored process [2024-11-07 09:58:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:43,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 09:58:43,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:00:02,471 WARN L286 SmtUtils]: Spent 30.32s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)