./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.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_wrapper-a_file-29.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', '337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9'] 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_wrapper-a_file-29.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 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:11:00,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:11:00,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:11:00,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:11:00,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:11:00,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:11:00,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:11:00,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:11:00,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:11:00,348 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:11:00,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:11:00,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:11:00,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:11:00,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:11:00,349 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:11:00,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:11:00,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:11:00,350 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:11:00,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:11:00,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:11:00,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:11:00,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:11:00,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:11:00,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:11:00,352 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:11:00,352 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:11:00,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:11:00,352 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:11:00,353 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:11:00,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:11:00,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:11:00,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:11:00,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:11:00,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:11:00,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:11:00,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:11:00,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:11:00,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:11:00,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:11:00,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:11:00,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:11:00,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:11:00,355 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 -> 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 [2024-11-07 10:11:00,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:11:00,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:11:00,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:11:00,603 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:11:00,603 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:11:00,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2024-11-07 10:11:01,745 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:11:02,015 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:11:02,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2024-11-07 10:11:02,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bb31e1e9/54864c14ee6d4a548989c38b44f1f902/FLAGdc551b06c [2024-11-07 10:11:02,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bb31e1e9/54864c14ee6d4a548989c38b44f1f902 [2024-11-07 10:11:02,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:11:02,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:11:02,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:11:02,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:11:02,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:11:02,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:11:02" (1/1) ... [2024-11-07 10:11:02,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46004780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:02, skipping insertion in model container [2024-11-07 10:11:02,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:11:02" (1/1) ... [2024-11-07 10:11:02,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:11:02,461 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_wrapper-a_file-29.i[916,929] [2024-11-07 10:11:02,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:11:02,519 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:11:02,527 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_wrapper-a_file-29.i[916,929] [2024-11-07 10:11:02,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:11:02,559 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:11:02,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:02 WrapperNode [2024-11-07 10:11:02,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:11:02,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:11:02,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:11:02,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:11:02,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:02" (1/1) ... [2024-11-07 10:11:02,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:02" (1/1) ... [2024-11-07 10:11:02,616 INFO L138 Inliner]: procedures = 29, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 422 [2024-11-07 10:11:02,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:11:02,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:11:02,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:11:02,617 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:11:02,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:02" (1/1) ... [2024-11-07 10:11:02,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:02" (1/1) ... [2024-11-07 10:11:02,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:02" (1/1) ... [2024-11-07 10:11:02,657 INFO L175 MemorySlicer]: Split 108 memory accesses to 5 slices as follows [2, 11, 53, 34, 8]. 49 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 3, 3, 2]. The 12 writes are split as follows [0, 2, 4, 3, 3]. [2024-11-07 10:11:02,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:02" (1/1) ... [2024-11-07 10:11:02,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:02" (1/1) ... [2024-11-07 10:11:02,682 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:02" (1/1) ... [2024-11-07 10:11:02,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:02" (1/1) ... [2024-11-07 10:11:02,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:02" (1/1) ... [2024-11-07 10:11:02,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:02" (1/1) ... [2024-11-07 10:11:02,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:11:02,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:11:02,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:11:02,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:11:02,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:02" (1/1) ... [2024-11-07 10:11:02,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:11:02,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:11:02,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:11:02,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:11:02,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:11:02,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:11:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:11:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:11:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:11:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-07 10:11:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:11:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:11:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:11:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:11:02,755 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 10:11:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:11:02,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:11:02,875 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:11:02,877 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:11:03,258 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-07 10:11:03,258 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:11:03,267 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:11:03,269 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:11:03,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:11:03 BoogieIcfgContainer [2024-11-07 10:11:03,269 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:11:03,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:11:03,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:11:03,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:11:03,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:11:02" (1/3) ... [2024-11-07 10:11:03,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9baecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:11:03, skipping insertion in model container [2024-11-07 10:11:03,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:02" (2/3) ... [2024-11-07 10:11:03,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9baecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:11:03, skipping insertion in model container [2024-11-07 10:11:03,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:11:03" (3/3) ... [2024-11-07 10:11:03,277 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-29.i [2024-11-07 10:11:03,288 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:11:03,289 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:11:03,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:11:03,354 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;@37a131fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:11:03,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:11:03,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:11:03,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:11:03,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:03,365 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:03,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:03,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:03,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1620841544, now seen corresponding path program 1 times [2024-11-07 10:11:03,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:11:03,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167819103] [2024-11-07 10:11:03,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:03,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:11:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:03,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:11:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:03,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:11:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:03,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:11:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:03,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:11:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:03,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:11:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:03,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:11:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:11:03,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:11:03,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167819103] [2024-11-07 10:11:03,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167819103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:03,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:03,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:11:03,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919423452] [2024-11-07 10:11:03,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:03,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:11:03,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:11:03,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:11:03,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:11:03,638 INFO L87 Difference]: Start difference. First operand has 88 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:11:03,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:03,655 INFO L93 Difference]: Finished difference Result 169 states and 254 transitions. [2024-11-07 10:11:03,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:11:03,657 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-07 10:11:03,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:03,662 INFO L225 Difference]: With dead ends: 169 [2024-11-07 10:11:03,662 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 10:11:03,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:11:03,667 INFO L432 NwaCegarLoop]: 120 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, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:03,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:11:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 10:11:03,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-07 10:11:03,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:11:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-11-07 10:11:03,701 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 73 [2024-11-07 10:11:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:03,701 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-11-07 10:11:03,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:11:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-11-07 10:11:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:11:03,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:03,704 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:03,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:11:03,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:03,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:03,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1061476096, now seen corresponding path program 1 times [2024-11-07 10:11:03,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:11:03,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675016063] [2024-11-07 10:11:03,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:03,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:11:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:03,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:11:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:03,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:11:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:03,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:11:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:03,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:11:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:03,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:11:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:03,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:11:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:11:03,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:11:03,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675016063] [2024-11-07 10:11:03,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675016063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:03,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:03,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:11:03,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123025779] [2024-11-07 10:11:03,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:03,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:11:03,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:11:03,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:11:03,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:11:03,932 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:11:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:03,994 INFO L93 Difference]: Finished difference Result 167 states and 240 transitions. [2024-11-07 10:11:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:11:03,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-07 10:11:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:03,995 INFO L225 Difference]: With dead ends: 167 [2024-11-07 10:11:03,995 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 10:11:03,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:11:03,996 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:03,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:11:03,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 10:11:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-07 10:11:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:11:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2024-11-07 10:11:04,007 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 73 [2024-11-07 10:11:04,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:04,008 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2024-11-07 10:11:04,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:11:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2024-11-07 10:11:04,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:11:04,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:04,010 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:04,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:11:04,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:04,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:04,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1102150846, now seen corresponding path program 1 times [2024-11-07 10:11:04,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:11:04,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652023399] [2024-11-07 10:11:04,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:04,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:11:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:04,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:11:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:04,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:11:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:04,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:11:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:04,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:11:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:04,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:11:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:04,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:11:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:11:04,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:11:04,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652023399] [2024-11-07 10:11:04,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652023399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:04,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:04,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:11:04,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157265099] [2024-11-07 10:11:04,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:04,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:11:04,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:11:04,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:11:04,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:11:04,205 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:11:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:04,242 INFO L93 Difference]: Finished difference Result 172 states and 245 transitions. [2024-11-07 10:11:04,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:11:04,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-07 10:11:04,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:04,243 INFO L225 Difference]: With dead ends: 172 [2024-11-07 10:11:04,243 INFO L226 Difference]: Without dead ends: 89 [2024-11-07 10:11:04,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:11:04,244 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:04,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 340 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:11:04,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-07 10:11:04,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-11-07 10:11:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:11:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2024-11-07 10:11:04,249 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 73 [2024-11-07 10:11:04,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:04,250 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2024-11-07 10:11:04,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:11:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2024-11-07 10:11:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:11:04,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:04,251 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:04,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:11:04,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:04,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash 672856516, now seen corresponding path program 1 times [2024-11-07 10:11:04,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:11:04,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565229712] [2024-11-07 10:11:04,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:04,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:11:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:04,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:11:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:04,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:11:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:04,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:11:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:11:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:04,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:11:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:04,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:11:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:11:04,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:11:04,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565229712] [2024-11-07 10:11:04,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565229712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:04,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:04,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:11:04,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330108148] [2024-11-07 10:11:04,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:04,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:11:04,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:11:04,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:11:04,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:11:04,412 INFO L87 Difference]: Start difference. First operand 88 states and 124 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:11:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:04,438 INFO L93 Difference]: Finished difference Result 176 states and 249 transitions. [2024-11-07 10:11:04,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:11:04,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-07 10:11:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:04,441 INFO L225 Difference]: With dead ends: 176 [2024-11-07 10:11:04,441 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 10:11:04,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:11:04,442 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:04,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:11:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 10:11:04,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-07 10:11:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:11:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2024-11-07 10:11:04,449 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 73 [2024-11-07 10:11:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:04,449 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2024-11-07 10:11:04,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:11:04,450 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2024-11-07 10:11:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:11:04,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:04,450 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:04,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:11:04,450 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:04,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:04,451 INFO L85 PathProgramCache]: Analyzing trace with hash 674703558, now seen corresponding path program 1 times [2024-11-07 10:11:04,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:11:04,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166280326] [2024-11-07 10:11:04,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:04,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:11:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:11:04,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:11:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:11:04,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:11:04,561 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:11:04,563 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:11:04,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:11:04,566 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 10:11:04,619 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:11:04,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:11:04 BoogieIcfgContainer [2024-11-07 10:11:04,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:11:04,623 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:11:04,623 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:11:04,623 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:11:04,623 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:11:03" (3/4) ... [2024-11-07 10:11:04,627 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:11:04,628 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:11:04,629 INFO L158 Benchmark]: Toolchain (without parser) took 2288.34ms. Allocated memory is still 117.4MB. Free memory was 93.5MB in the beginning and 53.0MB in the end (delta: 40.5MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2024-11-07 10:11:04,629 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:11:04,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.65ms. Allocated memory is still 117.4MB. Free memory was 93.2MB in the beginning and 79.4MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:11:04,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.55ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 76.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:11:04,630 INFO L158 Benchmark]: Boogie Preprocessor took 82.85ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 72.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:11:04,630 INFO L158 Benchmark]: RCFGBuilder took 568.65ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 44.2MB in the end (delta: 27.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-07 10:11:04,631 INFO L158 Benchmark]: TraceAbstraction took 1350.98ms. Allocated memory is still 117.4MB. Free memory was 43.6MB in the beginning and 53.0MB in the end (delta: -9.3MB). Peak memory consumption was 427.6kB. Max. memory is 16.1GB. [2024-11-07 10:11:04,631 INFO L158 Benchmark]: Witness Printer took 6.04ms. Allocated memory is still 117.4MB. Free memory was 53.0MB in the beginning and 53.0MB in the end (delta: 22.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:11:04,633 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.33ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.65ms. Allocated memory is still 117.4MB. Free memory was 93.2MB in the beginning and 79.4MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.55ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 76.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 82.85ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 72.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 568.65ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 44.2MB in the end (delta: 27.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1350.98ms. Allocated memory is still 117.4MB. Free memory was 43.6MB in the beginning and 53.0MB in the end (delta: -9.3MB). Peak memory consumption was 427.6kB. Max. memory is 16.1GB. * Witness Printer took 6.04ms. Allocated memory is still 117.4MB. Free memory was 53.0MB in the beginning and 53.0MB in the end (delta: 22.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 someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] isInitial = 1 [L83] FCALL initially() [L84] COND TRUE 1 [L85] FCALL updateLastVariables() [L86] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] float_Array_0[0] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[0] [L68] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L68] EXPR float_Array_0[0] [L68] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] float_Array_0[1] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[1] [L70] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L70] EXPR float_Array_0[1] [L70] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L72] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] RET updateVariables() [L87] CALL step() [L37] EXPR BOOL_unsigned_char_Array_0[1] [L37] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L38] EXPR unsigned_char_Array_0[1] [L38] unsigned_char_Array_0[2] = unsigned_char_Array_0[1] [L39] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L39] COND TRUE BOOL_unsigned_char_Array_0[0] [L40] EXPR float_Array_0[1] [L40] float_Array_0[2] = float_Array_0[1] [L46] EXPR float_Array_0[2] [L46] EXPR float_Array_0[2] [L46] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L46] COND FALSE !((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) [L49] EXPR unsigned_char_Array_0[2] [L49] unsigned_short_int_Array_0[1] = unsigned_char_Array_0[2] [L51] EXPR unsigned_char_Array_0[2] [L51] signed long int stepLocal_0 = 5 * unsigned_char_Array_0[2]; [L52] EXPR float_Array_0[1] [L52] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L52] EXPR ((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]) [L52] EXPR float_Array_0[1] [L52] EXPR ((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, stepLocal_0=0, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L52] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L52] COND FALSE !(((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) [L59] EXPR float_Array_0[2] [L59] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L59] COND TRUE float_Array_0[2] < float_Array_0[1] [L60] EXPR unsigned_char_Array_0[1] [L60] unsigned_char_Array_0[0] = unsigned_char_Array_0[1] [L87] RET step() [L88] CALL, EXPR property() [L78] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1) [L78] EXPR float_Array_0[2] [L78] EXPR float_Array_0[1] [L78] EXPR BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78-L79] return (((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) ; [L88] RET, EXPR property() [L88] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 1146 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 674 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 472 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=4, InterpolantAutomatonStates: 14, 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, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 240/240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 10:11:04,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.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 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:11:06,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:11:06,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:11:06,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:11:06,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:11:06,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:11:06,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:11:06,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:11:06,710 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:11:06,710 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:11:06,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:11:06,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:11:06,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:11:06,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:11:06,711 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:11:06,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:11:06,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:11:06,712 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:11:06,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:11:06,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:11:06,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:11:06,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:11:06,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:11:06,713 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:11:06,713 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:11:06,713 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:11:06,713 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:11:06,713 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:11:06,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:11:06,713 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:11:06,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:11:06,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:11:06,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:11:06,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:11:06,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:11:06,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:11:06,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:11:06,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:11:06,714 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:11:06,715 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:11:06,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:11:06,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:11:06,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:11:06,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:11:06,715 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 -> 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 [2024-11-07 10:11:06,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:11:07,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:11:07,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:11:07,004 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:11:07,005 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:11:07,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2024-11-07 10:11:08,165 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:11:08,386 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:11:08,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2024-11-07 10:11:08,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c703804a/da753000c76e46889978f44118a31ad9/FLAG4beb90f0b [2024-11-07 10:11:08,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c703804a/da753000c76e46889978f44118a31ad9 [2024-11-07 10:11:08,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:11:08,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:11:08,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:11:08,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:11:08,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:11:08,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:11:08" (1/1) ... [2024-11-07 10:11:08,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@324d2e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:08, skipping insertion in model container [2024-11-07 10:11:08,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:11:08" (1/1) ... [2024-11-07 10:11:08,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:11:08,883 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_wrapper-a_file-29.i[916,929] [2024-11-07 10:11:08,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:11:08,941 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:11:08,949 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_wrapper-a_file-29.i[916,929] [2024-11-07 10:11:08,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:11:09,002 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:11:09,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:09 WrapperNode [2024-11-07 10:11:09,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:11:09,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:11:09,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:11:09,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:11:09,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:09" (1/1) ... [2024-11-07 10:11:09,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:09" (1/1) ... [2024-11-07 10:11:09,059 INFO L138 Inliner]: procedures = 33, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 422 [2024-11-07 10:11:09,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:11:09,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:11:09,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:11:09,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:11:09,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:09" (1/1) ... [2024-11-07 10:11:09,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:09" (1/1) ... [2024-11-07 10:11:09,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:09" (1/1) ... [2024-11-07 10:11:09,086 INFO L175 MemorySlicer]: Split 108 memory accesses to 5 slices as follows [2, 11, 53, 34, 8]. 49 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 3, 3, 2]. The 12 writes are split as follows [0, 2, 4, 3, 3]. [2024-11-07 10:11:09,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:09" (1/1) ... [2024-11-07 10:11:09,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:09" (1/1) ... [2024-11-07 10:11:09,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:09" (1/1) ... [2024-11-07 10:11:09,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:09" (1/1) ... [2024-11-07 10:11:09,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:09" (1/1) ... [2024-11-07 10:11:09,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:09" (1/1) ... [2024-11-07 10:11:09,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:11:09,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:11:09,128 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:11:09,128 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:11:09,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:09" (1/1) ... [2024-11-07 10:11:09,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:11:09,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:11:09,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:11:09,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:11:09,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:11:09,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:11:09,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:11:09,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 10:11:09,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 10:11:09,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-07 10:11:09,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-07 10:11:09,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-07 10:11:09,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-07 10:11:09,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-07 10:11:09,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-07 10:11:09,175 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:11:09,176 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:11:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:11:09,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:11:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:11:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:11:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-07 10:11:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-07 10:11:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-07 10:11:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:11:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:11:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-07 10:11:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-07 10:11:09,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-07 10:11:09,287 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:11:09,289 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:11:19,615 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-07 10:11:19,616 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:11:19,625 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:11:19,626 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:11:19,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:11:19 BoogieIcfgContainer [2024-11-07 10:11:19,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:11:19,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:11:19,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:11:19,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:11:19,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:11:08" (1/3) ... [2024-11-07 10:11:19,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25bcc29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:11:19, skipping insertion in model container [2024-11-07 10:11:19,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:09" (2/3) ... [2024-11-07 10:11:19,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25bcc29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:11:19, skipping insertion in model container [2024-11-07 10:11:19,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:11:19" (3/3) ... [2024-11-07 10:11:19,635 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-29.i [2024-11-07 10:11:19,646 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:11:19,646 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:11:19,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:11:19,692 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;@3d72996d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:11:19,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:11:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:11:19,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:11:19,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:19,704 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:19,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:19,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:19,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1620841544, now seen corresponding path program 1 times [2024-11-07 10:11:19,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:19,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610165014] [2024-11-07 10:11:19,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:19,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:19,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:19,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:11:19,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 10:11:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:20,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:11:20,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-07 10:11:20,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:20,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:20,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610165014] [2024-11-07 10:11:20,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610165014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:20,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:20,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:11:20,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000644714] [2024-11-07 10:11:20,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:20,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:11:20,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:20,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:11:20,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:11:20,106 INFO L87 Difference]: Start difference. First operand has 88 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:11:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:20,121 INFO L93 Difference]: Finished difference Result 169 states and 254 transitions. [2024-11-07 10:11:20,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:11:20,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-07 10:11:20,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:20,131 INFO L225 Difference]: With dead ends: 169 [2024-11-07 10:11:20,132 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 10:11:20,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:11:20,135 INFO L432 NwaCegarLoop]: 120 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, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:20,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:11:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 10:11:20,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-07 10:11:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:11:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-11-07 10:11:20,192 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 73 [2024-11-07 10:11:20,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:20,193 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-11-07 10:11:20,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:11:20,193 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-11-07 10:11:20,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:11:20,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:20,198 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:20,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 10:11:20,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:20,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:20,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:20,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1061476096, now seen corresponding path program 1 times [2024-11-07 10:11:20,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:20,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330479892] [2024-11-07 10:11:20,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:20,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:20,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:20,403 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:11:20,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 10:11:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:20,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:11:20,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 10:11:20,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:20,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:20,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330479892] [2024-11-07 10:11:20,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330479892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:20,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:20,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:11:20,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064954551] [2024-11-07 10:11:20,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:20,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:11:20,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:20,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:11:20,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:11:20,781 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:11:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:20,854 INFO L93 Difference]: Finished difference Result 167 states and 240 transitions. [2024-11-07 10:11:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:11:20,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-07 10:11:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:20,856 INFO L225 Difference]: With dead ends: 167 [2024-11-07 10:11:20,856 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 10:11:20,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:11:20,857 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:20,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:11:20,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 10:11:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-07 10:11:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:11:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2024-11-07 10:11:20,862 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 73 [2024-11-07 10:11:20,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:20,863 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2024-11-07 10:11:20,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:11:20,863 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2024-11-07 10:11:20,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:11:20,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:20,864 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:20,874 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 10:11:21,065 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 10:11:21,065 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:21,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:21,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1102150846, now seen corresponding path program 1 times [2024-11-07 10:11:21,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:21,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972769852] [2024-11-07 10:11:21,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:21,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:21,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:21,068 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 10:11:21,070 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 10:11:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:21,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:11:21,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:11:21,453 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:21,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:21,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972769852] [2024-11-07 10:11:21,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972769852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:21,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:21,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:11:21,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656528350] [2024-11-07 10:11:21,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:21,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:11:21,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:21,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:11:21,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:11:21,454 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:11:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:21,604 INFO L93 Difference]: Finished difference Result 176 states and 251 transitions. [2024-11-07 10:11:21,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:11:21,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-07 10:11:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:21,605 INFO L225 Difference]: With dead ends: 176 [2024-11-07 10:11:21,605 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 10:11:21,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:11:21,606 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:21,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 544 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:11:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 10:11:21,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-07 10:11:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:11:21,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2024-11-07 10:11:21,614 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 73 [2024-11-07 10:11:21,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:21,615 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2024-11-07 10:11:21,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:11:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2024-11-07 10:11:21,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:11:21,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:21,616 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:21,626 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 10:11:21,816 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 10:11:21,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:21,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:21,817 INFO L85 PathProgramCache]: Analyzing trace with hash 672856516, now seen corresponding path program 1 times [2024-11-07 10:11:21,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:21,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590508309] [2024-11-07 10:11:21,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:21,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:21,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:21,820 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 10:11:21,822 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 10:11:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:22,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 10:11:22,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:11:22,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:22,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:22,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590508309] [2024-11-07 10:11:22,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590508309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:22,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:22,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:11:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063823230] [2024-11-07 10:11:22,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:22,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:11:22,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:22,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:11:22,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:11:22,173 INFO L87 Difference]: Start difference. First operand 92 states and 128 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:11:22,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:22,319 INFO L93 Difference]: Finished difference Result 184 states and 257 transitions. [2024-11-07 10:11:22,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:11:22,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-07 10:11:22,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:22,321 INFO L225 Difference]: With dead ends: 184 [2024-11-07 10:11:22,321 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 10:11:22,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:11:22,322 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:22,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 646 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:11:22,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 10:11:22,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-11-07 10:11:22,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:11:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2024-11-07 10:11:22,326 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 73 [2024-11-07 10:11:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:22,326 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 130 transitions. [2024-11-07 10:11:22,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:11:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2024-11-07 10:11:22,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:11:22,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:22,327 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:22,337 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 (5)] Ended with exit code 0 [2024-11-07 10:11:22,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:22,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:22,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:22,528 INFO L85 PathProgramCache]: Analyzing trace with hash 674703558, now seen corresponding path program 1 times [2024-11-07 10:11:22,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:22,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464515458] [2024-11-07 10:11:22,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:22,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:22,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:22,531 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:11:22,531 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 (6)] Waiting until timeout for monitored process [2024-11-07 10:11:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:22,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 10:11:22,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:23,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 67 [2024-11-07 10:11:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 10:11:23,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:11:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:11:24,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:24,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464515458] [2024-11-07 10:11:24,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464515458] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:11:24,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:11:24,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-11-07 10:11:24,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134416677] [2024-11-07 10:11:24,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:24,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:11:24,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:24,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:11:24,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:11:24,282 INFO L87 Difference]: Start difference. First operand 94 states and 130 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:11:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:25,159 INFO L93 Difference]: Finished difference Result 260 states and 359 transitions. [2024-11-07 10:11:25,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:11:25,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-07 10:11:25,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:25,162 INFO L225 Difference]: With dead ends: 260 [2024-11-07 10:11:25,162 INFO L226 Difference]: Without dead ends: 169 [2024-11-07 10:11:25,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:11:25,163 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 86 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:25,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 399 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:11:25,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-07 10:11:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2024-11-07 10:11:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 154 states have (on average 1.37012987012987) internal successors, (211), 155 states have internal predecessors, (211), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:11:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 229 transitions. [2024-11-07 10:11:25,173 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 229 transitions. Word has length 73 [2024-11-07 10:11:25,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:25,173 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 229 transitions. [2024-11-07 10:11:25,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:11:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 229 transitions. [2024-11-07 10:11:25,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:11:25,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:25,174 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:25,186 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 (6)] Ended with exit code 0 [2024-11-07 10:11:25,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:25,375 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:25,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:25,375 INFO L85 PathProgramCache]: Analyzing trace with hash -913644344, now seen corresponding path program 1 times [2024-11-07 10:11:25,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:25,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272354599] [2024-11-07 10:11:25,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:25,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:25,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:25,379 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:11:25,379 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 (7)] Waiting until timeout for monitored process [2024-11-07 10:11:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:25,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 10:11:25,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:25,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:11:26,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 67 [2024-11-07 10:11:26,539 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 10:11:26,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:11:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:11:27,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:27,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272354599] [2024-11-07 10:11:27,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272354599] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:11:27,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:11:27,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2024-11-07 10:11:27,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217818636] [2024-11-07 10:11:27,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:27,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:11:27,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:27,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:11:27,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:11:27,024 INFO L87 Difference]: Start difference. First operand 166 states and 229 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:11:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:28,014 INFO L93 Difference]: Finished difference Result 423 states and 580 transitions. [2024-11-07 10:11:28,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:11:28,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-07 10:11:28,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:28,017 INFO L225 Difference]: With dead ends: 423 [2024-11-07 10:11:28,017 INFO L226 Difference]: Without dead ends: 254 [2024-11-07 10:11:28,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:11:28,018 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 114 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:28,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 430 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:11:28,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-07 10:11:28,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 166. [2024-11-07 10:11:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 155 states have internal predecessors, (210), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:11:28,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 228 transitions. [2024-11-07 10:11:28,029 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 228 transitions. Word has length 73 [2024-11-07 10:11:28,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:28,030 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 228 transitions. [2024-11-07 10:11:28,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:11:28,030 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 228 transitions. [2024-11-07 10:11:28,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:11:28,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:28,035 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:28,046 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 (7)] Ended with exit code 0 [2024-11-07 10:11:28,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:28,236 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:28,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:28,236 INFO L85 PathProgramCache]: Analyzing trace with hash -490942518, now seen corresponding path program 1 times [2024-11-07 10:11:28,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:28,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787010065] [2024-11-07 10:11:28,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:28,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:28,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:28,239 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:11:28,239 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 (8)] Waiting until timeout for monitored process [2024-11-07 10:11:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:28,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 10:11:28,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:29,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 67 [2024-11-07 10:11:29,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:11:29,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 58 [2024-11-07 10:11:29,432 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 10:11:29,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:11:29,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:29,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787010065] [2024-11-07 10:11:29,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787010065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:11:29,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1797025793] [2024-11-07 10:11:29,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:29,750 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:11:29,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:11:29,752 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 10:11:29,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-07 10:11:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:30,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 10:11:30,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:30,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 55 [2024-11-07 10:11:31,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:11:31,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 46 [2024-11-07 10:11:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 10:11:31,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:11:31,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1797025793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:11:31,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:11:31,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2024-11-07 10:11:31,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360982809] [2024-11-07 10:11:31,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:11:31,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 10:11:31,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:31,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 10:11:31,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2024-11-07 10:11:31,373 INFO L87 Difference]: Start difference. First operand 166 states and 228 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-07 10:11:34,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:36,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:39,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:42,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:47,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:51,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:54,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:56,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:12:00,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:12:02,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:12:06,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:12:08,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:12:09,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:12:09,152 INFO L93 Difference]: Finished difference Result 558 states and 765 transitions. [2024-11-07 10:12:09,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:12:09,153 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2024-11-07 10:12:09,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:12:09,154 INFO L225 Difference]: With dead ends: 558 [2024-11-07 10:12:09,154 INFO L226 Difference]: Without dead ends: 395 [2024-11-07 10:12:09,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 180 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2024-11-07 10:12:09,156 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 501 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:12:09,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 885 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 37.2s Time] [2024-11-07 10:12:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-07 10:12:09,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 259. [2024-11-07 10:12:09,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 240 states have (on average 1.3666666666666667) internal successors, (328), 242 states have internal predecessors, (328), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:12:09,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 358 transitions. [2024-11-07 10:12:09,168 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 358 transitions. Word has length 73 [2024-11-07 10:12:09,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:12:09,169 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 358 transitions. [2024-11-07 10:12:09,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-07 10:12:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 358 transitions. [2024-11-07 10:12:09,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:12:09,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:12:09,173 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:12:09,187 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 (8)] Ended with exit code 0 [2024-11-07 10:12:09,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-07 10:12:09,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 10:12:09,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:12:09,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:12:09,574 INFO L85 PathProgramCache]: Analyzing trace with hash -844030900, now seen corresponding path program 1 times [2024-11-07 10:12:09,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:12:09,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347875010] [2024-11-07 10:12:09,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:12:09,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:12:09,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:12:09,576 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:12:09,577 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 (10)] Waiting until timeout for monitored process [2024-11-07 10:12:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:09,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:12:09,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:12:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 10:12:09,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:12:09,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:12:09,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347875010] [2024-11-07 10:12:09,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347875010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:12:09,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:12:09,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:12:09,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278284662] [2024-11-07 10:12:09,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:12:09,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:12:09,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:12:09,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:12:09,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:12:09,864 INFO L87 Difference]: Start difference. First operand 259 states and 358 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:12:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:12:09,925 INFO L93 Difference]: Finished difference Result 515 states and 713 transitions. [2024-11-07 10:12:09,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:12:09,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-07 10:12:09,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:12:09,928 INFO L225 Difference]: With dead ends: 515 [2024-11-07 10:12:09,928 INFO L226 Difference]: Without dead ends: 259 [2024-11-07 10:12:09,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:12:09,930 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:12:09,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 346 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:12:09,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-07 10:12:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-11-07 10:12:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 240 states have (on average 1.3625) internal successors, (327), 242 states have internal predecessors, (327), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:12:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 357 transitions. [2024-11-07 10:12:09,946 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 357 transitions. Word has length 73 [2024-11-07 10:12:09,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:12:09,947 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 357 transitions. [2024-11-07 10:12:09,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:12:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 357 transitions. [2024-11-07 10:12:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 10:12:09,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:12:09,947 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:12:09,958 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 (10)] Ended with exit code 0 [2024-11-07 10:12:10,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:12:10,151 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:12:10,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:12:10,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2036446323, now seen corresponding path program 1 times [2024-11-07 10:12:10,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:12:10,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666923966] [2024-11-07 10:12:10,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:12:10,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:12:10,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:12:10,154 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:12:10,155 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 (11)] Waiting until timeout for monitored process [2024-11-07 10:12:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:10,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 10:12:10,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:12:10,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:12:11,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 67 [2024-11-07 10:12:11,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:12:12,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 80 [2024-11-07 10:12:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 10:12:12,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:12:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:12:13,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:12:13,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666923966] [2024-11-07 10:12:13,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666923966] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:12:13,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:12:13,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2024-11-07 10:12:13,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379103199] [2024-11-07 10:12:13,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:12:13,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:12:13,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:12:13,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:12:13,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2024-11-07 10:12:13,742 INFO L87 Difference]: Start difference. First operand 259 states and 357 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:12:16,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 10:12:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:12:19,509 INFO L93 Difference]: Finished difference Result 670 states and 915 transitions. [2024-11-07 10:12:19,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:12:19,511 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 74 [2024-11-07 10:12:19,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:12:19,512 INFO L225 Difference]: With dead ends: 670 [2024-11-07 10:12:19,513 INFO L226 Difference]: Without dead ends: 414 [2024-11-07 10:12:19,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2024-11-07 10:12:19,513 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 408 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:12:19,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 888 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-07 10:12:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-07 10:12:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 269. [2024-11-07 10:12:19,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 250 states have (on average 1.364) internal successors, (341), 252 states have internal predecessors, (341), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:12:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 371 transitions. [2024-11-07 10:12:19,527 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 371 transitions. Word has length 74 [2024-11-07 10:12:19,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:12:19,527 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 371 transitions. [2024-11-07 10:12:19,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:12:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 371 transitions. [2024-11-07 10:12:19,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 10:12:19,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:12:19,528 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:12:19,540 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 (11)] Ended with exit code 0 [2024-11-07 10:12:19,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:12:19,729 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:12:19,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:12:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash -279510336, now seen corresponding path program 1 times [2024-11-07 10:12:19,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:12:19,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793738934] [2024-11-07 10:12:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:12:19,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:12:19,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:12:19,731 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:12:19,732 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 (12)] Waiting until timeout for monitored process [2024-11-07 10:12:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:19,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 10:12:19,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:12:20,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2024-11-07 10:12:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 10:12:20,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:12:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-07 10:12:21,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:12:21,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793738934] [2024-11-07 10:12:21,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793738934] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:12:21,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:12:21,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2024-11-07 10:12:21,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412223356] [2024-11-07 10:12:21,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:12:21,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 10:12:21,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:12:21,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 10:12:21,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:12:21,178 INFO L87 Difference]: Start difference. First operand 269 states and 371 transitions. Second operand has 16 states, 12 states have (on average 6.166666666666667) internal successors, (74), 16 states have internal predecessors, (74), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-07 10:12:21,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:12:21,744 INFO L93 Difference]: Finished difference Result 401 states and 538 transitions. [2024-11-07 10:12:21,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 10:12:21,745 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 6.166666666666667) internal successors, (74), 16 states have internal predecessors, (74), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) Word has length 74 [2024-11-07 10:12:21,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:12:21,746 INFO L225 Difference]: With dead ends: 401 [2024-11-07 10:12:21,746 INFO L226 Difference]: Without dead ends: 135 [2024-11-07 10:12:21,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-11-07 10:12:21,747 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 84 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:12:21,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 692 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:12:21,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-07 10:12:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2024-11-07 10:12:21,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 116 states have internal predecessors, (146), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:12:21,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2024-11-07 10:12:21,757 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 74 [2024-11-07 10:12:21,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:12:21,757 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2024-11-07 10:12:21,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 6.166666666666667) internal successors, (74), 16 states have internal predecessors, (74), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-07 10:12:21,757 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2024-11-07 10:12:21,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 10:12:21,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:12:21,758 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:12:21,773 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 (12)] Ended with exit code 0 [2024-11-07 10:12:21,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:12:21,959 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:12:21,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:12:21,959 INFO L85 PathProgramCache]: Analyzing trace with hash 109203088, now seen corresponding path program 1 times [2024-11-07 10:12:21,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:12:21,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823083537] [2024-11-07 10:12:21,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:12:21,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:12:21,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:12:21,961 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:12:21,962 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 (13)] Waiting until timeout for monitored process [2024-11-07 10:12:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:22,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 10:12:22,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:12:22,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 65 [2024-11-07 10:12:23,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:12:23,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 56 [2024-11-07 10:12:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 10:12:23,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:12:23,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:12:23,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823083537] [2024-11-07 10:12:23,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823083537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:12:23,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [122890976] [2024-11-07 10:12:23,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:12:23,831 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:12:23,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:12:23,833 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 10:12:23,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-07 10:12:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:24,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 10:12:24,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:12:25,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 54 [2024-11-07 10:12:25,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:12:25,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 45 [2024-11-07 10:12:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 10:12:25,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:12:25,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [122890976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:12:25,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:12:25,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2024-11-07 10:12:25,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641785777] [2024-11-07 10:12:25,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:12:25,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 10:12:25,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:12:25,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 10:12:25,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2024-11-07 10:12:25,676 INFO L87 Difference]: Start difference. First operand 131 states and 164 transitions. Second operand has 21 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 5 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-07 10:12:29,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:12:32,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:12:36,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:12:39,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:12:43,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:12:44,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []